Sciweavers

1971 search results - page 244 / 395
» Tabu search - Uncharted domains
Sort
View
CP
2006
Springer
15 years 10 months ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
AIPS
2007
15 years 8 months ago
Online Planning for Resource Production in Real-Time Strategy Games
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
ATAL
2008
Springer
15 years 8 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
EURONGI
2008
Springer
15 years 8 months ago
Performance Evaluation of Overlay-Based Range Queries in Mobile Systems
Current mobility management systems are operator centralized, and focused on single link technologies. In heterogeneous wireless mesh networks, vertical handovers could be a length...
Amine M. Houyou, Alexander Stenzer, Hermann de Mee...
EWCBR
2008
Springer
15 years 8 months ago
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
Neha Sugandh, Santiago Ontañón, Ashw...