Sciweavers

357 search results - page 23 / 72
» Is Computational Complexity a Barrier to Manipulation
Sort
View
ATAL
2009
Springer
16 years 11 days ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein
CLOUDCOM
2010
Springer
15 years 3 months ago
Performing Large Science Experiments on Azure: Pitfalls and Solutions
Carrying out science at extreme scale is the next generational challenge facing the broad field of scientific research. Cloud computing offers to potential for an increasing number...
Wei Lu, Jared Jackson, Jaliya Ekanayake, Roger S. ...
PPOPP
1997
ACM
15 years 10 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
156
Voted
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 11 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...
APCSAC
2007
IEEE
16 years 4 days ago
Implicit Transactional Memory in Kilo-Instruction Multiprocessors
Although they have been the main server technology for many years, multiprocessors are undergoing a renaissance due to multi-core chips and the attractive scalability properties of...
Marco Galluzzi, Enrique Vallejo, Adrián Cri...