428 search results - page 32 / 86 » An asynchronous complete method for distributed constraint o... |
109
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
142
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
135
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper we develop a theory of metamodules and an associated distributed asynchronous planner which generalizes previous work on metamodules for lattice-based modular rob...
195
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
153
click to vote
ICDCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...