203 search results - page 12 / 41 » Exponentiable morphisms of domains |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
ATAL
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
IJCAI
2007
13 years 9 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
IJHPCN
2006
13 years 7 months ago
2006
Sensors and other small devices that periodically transmit relatively small packets of information motivate the study of hash chains with small domains and ranges. Hash chain based...
IAT
2008
IEEE
14 years 2 months ago
2008
IEEE
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...