Sciweavers

1191 search results - page 108 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
AI
2012
Springer
13 years 5 months ago
Plan recognition in exploratory domains
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...
SIGCOMM
2012
ACM
13 years 10 days ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 2 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICSE
2008
IEEE-ACM
15 years 10 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
WWW
2004
ACM
15 years 10 months ago
FADA: find all distinct answers
The wealth of information available on the web makes it an attractive resource for seeking quick answers. While web-based question answering becomes an emerging topic in recent ye...
Hui Yang, Tat-Seng Chua