Sciweavers

1738 search results - page 53 / 348
» Local Consistency and SAT-Solvers
Sort
View
COORDINATION
2005
Springer
14 years 1 months 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...
ACTA
2006
108views more  ACTA 2006»
13 years 7 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
ENTCS
2002
78views more  ENTCS 2002»
13 years 7 months ago
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
IPPS
2007
IEEE
14 years 1 months ago
Online Aggregation over Trees
Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula