15421 search results - page 2743 / 3085 » Dependability |
244
click to vote
ADHOCNOW
2004
Springer
16 years 28 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
195
click to vote
AMAI
2004
Springer
16 years 28 days ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
199
click to vote
ASIAN
2004
Springer
16 years 28 days ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
206
Voted
ASM
2004
ASM
16 years 28 days ago
2004
ASM
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
205
Voted
ATAL
2004
Springer
16 years 28 days ago
2004
Springer
CHRISTIAN, DAVID B. Strategic Deception in Agents. (Under the direction of Assistant Professor R. Michael Young). Despite its negative ethical connotations, deception is a useful ...