64 search results - page 4 / 13 » New Dynamic Heuristics in the Client-Agent-Server Model |
ATMOS
2007
13 years 10 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
ECAI
1998
Springer
14 years 24 days ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
JSAT
2008
13 years 8 months ago
2008
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
AAAI
1994
13 years 10 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
GECCO
2006
Springer
14 years 6 days ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...