نتایج جستجو برای: weighted logic metric

تعداد نتایج: 327475  

2002
Panos Giannopoulos Remco C. Veltkamp

We present a pseudo-metric for weighted point sets. There are numerous situations, for example in the shape description domain, where the individual points in a feature point set have an associated attribute, a weight. A distance function that incorporates this extra information apart from the points' position can be very useful for matching and retrieval purposes. There are two main approaches...

2015
Francis Thamburaj A. Aloysius

Method hiding plays a key role by serving the foundation for several guidelines in object-oriented software design. It brings about plethora of benefits such as easy comprehension, secured accessibility, modifiability without side-effects, modular testing, higher reliability etc. But, it has to be handled carefully since very low method hiding may result in insufficiently abstracted implementat...

Journal: :Ann. Pure Appl. Logic 2010
Mikhail Sheremet Frank Wolter Michael Zakharyaschev

In 1944, McKinsey and Tarski proved that S4 is the logic of the topological interior and closure operators of any separable dense-in-itself metric space. Thus, the logic of topological interior and closure over arbitrary metric spaces coincides with the logic of the real line, the real plane, and any separable dense-in-itself metric space; it is finitely axiomatisable and PSpace-complete. Becau...

Journal: :Inf. Comput. 2006
Thomas Brihaye Véronique Bruyère Jean-François Raskin

In this paper we study the model-checking problem for weighted timed automata and the weighted CTL logic ; we also study the finiteness of bisimulations of weighted timed automata. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with the restriction that the stopwatches cannot be reset nor t...

Journal: :Fundam. Inform. 2004
Yoram Hirshfeld Alexander Moshe Rabinovich

Over the last fifteen years formalisms for reasoning about metric properties of computations were suggested and discussed. First as extensions of temporal logic, ignoring the framework of classical predicate logic, and then, with the authors’ work, within the framework of monadic logic of order. Here we survey our work on metric logic comparing it to the previous work in the field. We define a ...

2012
H. Boujut J. Benois - Pineau T. Ahmed O. Hadar P. Bonnet

—The paper contributes to video quality assessment of delivered content without reference. We propose a no-reference video quality assessment metric taking into account the behavior of the human visual system. The proposed metric called Weighted Macro-Block Error Rate (WMBER) is based on macro-block error detection and is weighted by visual saliency maps. Both measures are extracted from a part...

2014
Manfred Droste Vitaly Perevoshchikov

Weighted timed automata (WTA) model quantitative aspects of real-time systems like continuous consumption of memory, power or financial resources. They accept quantitative timed languages where every timed word is mapped to a value, e.g., a real number. In this paper, we prove a Nivat theorem for WTA which states that recognizable quantitative timed languages are exactly those which can be obta...

Journal: :Jurnal ilmiah informatika global 2021

This research implements a fuzzy topsis based system for selecting the best employees at PT. Delta World Textil. One of matters, especially in management Human Energy Resources (HR) is selection periodically, so that those who are elected will be given an award form bonus order to motivate improve their service and performance. The quality legacy industry wants make grow rapidly. Several method...

Journal: :TPLP 2011
Shay B. Cohen Robert J. Simmons Noah A. Smith

Weighted logic programming, a generalization of bottom-up logic programming, is a wellsuited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm’s output space, such as a path through a graph or a grammatical derivation, and are given a real-valued score (often interpreted as a probability) that depends on the real weights of the base axi...

2004
Pierangelo Dell'Acqua

We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs) that allow one to assign a measure of strength to the knowledge relationships represented by the edges. We present the declarative and operational semantics of such a framework, and give results of correctness. We illustrate t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید