Sciweavers

8780 search results - page 276 / 1756
» On the Feasibility of Consistent Computations
Sort
View
195
Voted
SCL
2011
15 years 2 months ago
Analysis of consensus protocols with bounded measurement errors
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
Andrea Garulli, Antonio Giannitrapani
EOR
2008
106views more  EOR 2008»
15 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
COORDINATION
2005
Springer
16 years 29 days ago
Delegation Modeling with Paradigm
Within one model, behavioural consistency of its constituents is often problematic. Within UML such horizontal behavioural consistency between the objects of a concrete model, is p...
Luuk Groenewegen, Niels van Kampenhout, Erik P. de...
CL
2000
Springer
15 years 11 months ago
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
Marcelo Arenas, Leopoldo E. Bertossi, Michael Kife...
159
Voted
ICPR
2010
IEEE
15 years 6 months ago
A Game-Theoretic Approach to Robust Selection of Multi-View Point Correspondence
In this paper we introduce a robust matching technique that allows to operate a very accurate selection of corresponding feature points from multiple views. Robustness is achieved...
Emanuele Rodolà, Andrea Albarelli, Andrea Torsell...