Sciweavers

2261 search results - page 144 / 453
» The problem with scalability
Sort
View
134
Voted
CONCURRENCY
2004
77views more  CONCURRENCY 2004»
15 years 4 months ago
Grids of agents for computer and telecommunication network management
The centralized system approach for computer and telecommunication network management has been presenting scalability problems along with the growth in the number and diversity of...
Marcos Dias de Assunção, Fernando Lu...
AIPS
2011
14 years 8 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
ICCD
2008
IEEE
175views Hardware» more  ICCD 2008»
16 years 1 months ago
Contention-aware application mapping for Network-on-Chip communication architectures
- In this paper, we analyze the impact of network contention on the application mapping for tile-based Networkon-Chip (NoC) architectures. Our main theoretical contribution consist...
Chen-Ling Chou, Radu Marculescu
AIPS
2008
15 years 7 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
147
Voted
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 11 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith