Sciweavers

1450 search results - page 114 / 290
» On the Complexity of Hardness Amplification
Sort
View
EDO
2000
Springer
14 years 23 days ago
Distributed Proxy: A Design Pattern for the Incremental Development of Distributed Applications
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...
António Rito Silva, Francisco Assis Rosa, T...
CHI
1995
ACM
14 years 21 days ago
Dinosaur Input Device
We present a system for animating an articulate figure using a physical skeleton, or armature, connected to a workstation. The skeleton is covered with sensors that monitor the o...
Brian Knep, Craig Hayes, Rick Sayre, Tom Williams
AAAI
2007
13 years 11 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
AAAI
2008
13 years 11 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
AAAI
2007
13 years 11 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein