2735 search results - page 285 / 547 » Comparing notions of randomness |
FLAIRS
2008
14 years 1 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
ARCS
2008
Springer
14 years 1 months ago
2008
Springer
Application details uncertain at design time as well as tolerance against permanent resource defects demand flexibility and redundancy. In this context, we present a strategy for p...
BROADCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper we propose and analyze an efficient flooding technique for static multi-hop wireless networks. The protocol builds up a routing tree that connects all network nodes....
ECAI
2008
Springer
14 years 24 days 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...
ESTIMEDIA
2008
Springer
14 years 24 days ago
2008
Springer
Markov random field models provide a robust formulation of low-level vision problems. Among the problems, stereo vision remains the most investigated field. The belief propagation...