4679 search results - page 111 / 936 » Modeling When Connections Are the Problem |
EOR
2008
15 years 1 months ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
124
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Multiobjective evolutionary algorithms (MOEA) are an effective tool for solving search and optimization problems containing several incommensurable and possibly conflicting objec...
ISAAC
1992
Springer
15 years 5 months ago
1992
Springer
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
100
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
111
click to vote
GECCO
2000
Springer
15 years 5 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...