2354 search results - page 264 / 471 » Randomness, Stochasticity and Approximations |
154
click to vote
AI
2003
Springer
15 years 11 months 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 ...
129
click to vote
IPPS
2000
IEEE
15 years 10 months 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...
179
Voted
DCOSS
2005
Springer
15 years 8 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...
163
Voted
ECAI
2008
Springer
15 years 8 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...
145
Voted
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...