7106 search results - page 1088 / 1422 » Restricted Complexity, General Complexity |
201
click to vote
WICON
2008
15 years 8 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
144
click to vote
AAAI
2004
15 years 8 months ago
2004
Reactive planning using assumptions is a well-known approach to tackle complex planning problems for nondeterministic, partially observable domains. However, assumptions may be wr...
184
click to vote
AAAI
2006
15 years 8 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
179
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper addresses the problem of activity recognition for physically-embodied agent teams. We define team activity recognition as the process of identifying team behaviors from...
188
click to vote
ACID
2006
15 years 8 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...