3055 search results - page 434 / 611 » Randomized Search Trees |
204
click to vote
SAGA
2009
Springer
15 years 11 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
134
click to vote
TMC
2008
15 years 4 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
143
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
150
click to vote
WSC
2004
15 years 5 months ago
2004
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
125
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...