8540 search results - page 1335 / 1708 » The Dynamic Servers Problem |
147
click to vote
AIPS
2007
15 years 7 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
174
click to vote
WSC
2007
15 years 7 months ago
2007
Simulation of dynamic complex systems—specifically, those comprised of large numbers of components with stochastic behaviors—for the purpose of probabilistic risk assessment f...
161
Voted
APNOMS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Wireless sensor network is a suitable technology for ubiquitous environment. However, in WSN, as the network size grows larger, overheads such as flooding, calculation an...
144
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
160
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...