Sciweavers

1945 search results - page 181 / 389
» Speeding up Serpent
Sort
View
AIPS
1994
15 years 7 months ago
Managing Dynamic Temporal Constraint Networks
This paper concerns the specialization of arcconsistency algorithms for constraint satisfaction in the management of quantitative temporal constraint networks. Attention is devote...
Roberto Cervoni, Amedeo Cesta, Angelo Oddi
AIPS
1996
15 years 7 months ago
Computing Parameter Domains as an Aid to Planning
Weshowthat by inferring parametexdomainsof planningoperators,given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process...
Alfonso Gerevini, Lenhart K. Schubert
IJCAI
1989
15 years 7 months ago
Experiences Implementing a Parallel ATMS on a Shared-Memory Multiprocessor
The Assumption-Based Truth Maintenance System (ATMS) is an important tool in A I . So far its wider use has been limited due to the enormous computational resources which it requi...
Edward Rothberg, Anoop Gupta
ECAI
2010
Springer
15 years 7 months ago
Case-Based Multiagent Reinforcement Learning: Cases as Heuristics for Selection of Actions
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Multiagent Reinforcement Learning algorithms, combining Case-Based Reasoning...
Reinaldo A. C. Bianchi, Ramon López de M&aa...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
15 years 7 months ago
Towards incremental social learning in optimization and multiagent systems
Social learning is a mechanism that allows individuals to acquire knowledge from others without incurring the costs of acquiring it individually. Individuals that learn socially c...
Marco Antonio Montes de Oca, Thomas Stützle