2626 search results - page 278 / 526 » The complexity of stochastic sequences |
178
click to vote
JAIR
2006
15 years 6 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
143
click to vote
JCST
2006
15 years 6 months ago
2006
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
176
click to vote
JSAC
2006
15 years 6 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
184
click to vote
EOR
2007
15 years 6 months ago
2007
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting the...
170
click to vote
JAIR
2000
15 years 6 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...