2313 search results - page 230 / 463 » On Heuristic Time Hierarchies |
185
click to vote
AIPS
2008
15 years 9 months ago
2008
This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...
163
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
177
click to vote
ALENEX
2010
15 years 8 months ago
2010
Monitoring the performance of large shared computing systems such as the cloud computing infrastructure raises many challenging algorithmic problems. One common problem is to trac...
185
click to vote
AAAI
2000
15 years 8 months ago
2000
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
182
click to vote
ECAI
2010
Springer
15 years 6 months ago
2010
Springer
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...