Sciweavers

2084 search results - page 61 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
ECAI
2006
Springer
15 years 1 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
Amir Gershman, Amnon Meisels, Roie Zivan
COCOON
2005
Springer
14 years 11 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
NAS
2010
IEEE
14 years 8 months ago
Time-Bounded Essential Localization for Wireless Sensor Networks
In many practical applications of wireless sensor networks, it is crucial to accomplish the localization of sensors within a given time bound. We find that the traditional defin...
Wei Cheng, Nan Zhang 0004, Min Song, Dechang Chen,...
RSA
2006
68views more  RSA 2006»
14 years 9 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
EDBT
2006
ACM
136views Database» more  EDBT 2006»
15 years 10 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen