Sciweavers

88 search results - page 10 / 18
» Stigmergic reasoning over hierarchical task networks
Sort
View
AAAI
2010
13 years 9 months ago
Goal-Driven Autonomy in a Navy Strategy Simulation
Modern complex games and simulations pose many challenges for an intelligent agent, including partial observability, continuous time and effects, hostile opponents, and exogenous ...
Matthew Molineaux, Matthew Klenk, David W. Aha
AAAI
2010
13 years 9 months ago
Planning in Dynamic Environments: Extending HTNs with Nonlinear Continuous Effects
Planning in dynamic continuous environments requires reasoning about nonlinear continuous effects, which previous Hierarchical Task Network (HTN) planners do not support. In this ...
Matthew Molineaux, Matthew Klenk, David W. Aha
NOMS
2006
IEEE
147views Communications» more  NOMS 2006»
14 years 1 months ago
DiMAPI: An Application Programming Interface for Distributed Network Monitoring
Abstract— Network monitoring and measurement is commonly regarded as an essential function for understanding, managing and improving the performance and security of network infra...
Panos Trimintzios, Michalis Polychronakis, Antonis...
AINA
2009
IEEE
14 years 2 months ago
Improving Opportunistic Data Dissemination via Known Vector
An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task an...
Jyh-How Huang, Ying-Yu Chen, Yi-Chao Chen, Shivaka...
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti