Sciweavers

14649 search results - page 98 / 2930
» Principles of problem solving
Sort
View
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 3 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
IWMM
1998
Springer
103views Hardware» more  IWMM 1998»
15 years 3 months ago
The Memory Fragmentation Problem: Solved?
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
Mark S. Johnstone, Paul R. Wilson
WIA
2000
Springer
15 years 2 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto
AAAI
2007
15 years 1 months ago
Solving a Stochastic Queueing Design and Control Problem with Constraint Programming
A facility with front room and back room operations has the option of hiring specialized or, more expensive, cross-trained workers. Assuming stochastic customer arrival and servic...
Daria Terekhov, J. Christopher Beck, Kenneth N. Br...
ECAI
2008
Springer
15 years 22 days ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson