2996 search results - page 217 / 600 » Numberings and Randomness |
149
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
157
click to vote
JSAT
2008
15 years 6 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
183
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
156
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
175
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...