Sciweavers

4377 search results - page 330 / 876
» Mass problems and randomness
Sort
View
WADS
2007
Springer
96views Algorithms» more  WADS 2007»
16 years 27 days ago
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
Martin Farach-Colton, Miguel A. Mosteiro
KI
1999
Springer
15 years 11 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
165
Voted
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 11 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 10 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
CORR
2007
Springer
131views Education» more  CORR 2007»
15 years 6 months ago
Bayesian sequential change diagnosis
Sequential change diagnosis is the joint problem of detection and identification of a sudden and unobservable change in the distribution of a random sequence. In this problem, the...
Savas Dayanik, Christian Goulding, H. Vincent Poor