Sciweavers

835 search results - page 83 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
WSC
2004
14 years 11 months ago
Optimal Computing Budget Allocation for Multi-Objective Simulation Models
Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are o...
Loo Hay Lee, Ek Peng Chew, Suyan Teng, David Golds...
TCAD
2008
103views more  TCAD 2008»
14 years 9 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
14 years 9 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
JSAC
2008
140views more  JSAC 2008»
14 years 10 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham