3637 search results - page 533 / 728 » On Dynamic Bit-Probe Complexity |
193
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
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 ...
190
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
178
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
147
click to vote
CAISE
2009
Springer
16 years 1 months ago
2009
Springer
Introducing enterprise information systems (EIS) is usually associated with high costs. It is therefore crucial to understand those factors that determine or influence these costs...
180
click to vote
ESAW
2009
Springer
16 years 1 months ago
2009
Springer
Autonomous software agents provide a promising solution to the needs of decentralised networked systems, able to adapt their behaviour in a complex and dynamically changing environ...