627 search results - page 92 / 126 » Kolmogorov-Loveland Randomness and Stochasticity |
EGC
2005
Springer
14 years 1 months ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
AI
2003
Springer
14 years 26 days ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
For bulk synchronous computations that have nondeterministic behaviors, dynamic remapping is an effective approach to ensure parallel efficiency. There are two basic issues in re...
DCOSS
2005
Springer
13 years 9 months ago
2005
Springer
In this paper, we consider the problem of energy balanced data propagation in wireless sensor networks and we generalise previous works by allowing realistic energy assignment. A n...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...