2996 search results - page 368 / 600 » Numberings and Randomness |
177
click to vote
MJ
2007
15 years 6 months ago
2007
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
151
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—We study broadcasting on multiple access channels by deterministic distributed protocols. Data arrivals are governed by an adversary. The power of the adversary is constrained b...
165
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
166
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
166
click to vote
TALG
2010
15 years 5 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...