Sciweavers

1119 search results - page 164 / 224
» Computing in the Presence of Timing Failures
Sort
View
AIPS
2010
13 years 10 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
AI
2008
Springer
13 years 7 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
HAPTICS
2009
IEEE
14 years 2 months ago
Remote dynamic proxies for wave-based peer-to-peer haptic interaction
This paper introduces a distributed haptic control architecture that can render direct interaction between users in addition to cooperative manipulation of virtual objects. The pr...
Zhi Li, Daniela Constantinescu
ICDCS
2003
IEEE
14 years 28 days ago
Performance Guarantees for Cluster-Based Internet Services
As web-based transactions become an essential element of everyday corporate and commerce activities, it becomes increasingly important that the performance of web-based services b...
Chang Li, Gang Peng, Kartik Gopalan, Tzi-cker Chiu...