Sciweavers

8540 search results - page 112 / 1708
» The Dynamic Servers Problem
Sort
View
COMPULOG
1999
Springer
15 years 2 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
TSMC
2008
109views more  TSMC 2008»
14 years 9 months ago
Analysis of CCME: Coevolutionary Dynamics, Automatic Problem Decomposition, and Regularization
In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...
Minh Ha Nguyen, Hussein A. Abbass, Robert I. McKay
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
14 years 11 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
14 years 9 months ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
FLAIRS
2004
14 years 11 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar