Sciweavers

13987 search results - page 149 / 2798
» The Two Guards Problem
Sort
View
133
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 9 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
125
Voted
ATAL
2004
Springer
15 years 9 months ago
Unifying Temporal and Structural Credit Assignment Problems
Single-agent reinforcement learners in time-extended domains and multi-agent systems share a common dilemma known as the credit assignment problem. Multi-agent systems have the st...
Adrian K. Agogino, Kagan Tumer
164
Voted
CEC
2011
IEEE
14 years 3 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
130
Voted
PPSN
1998
Springer
15 years 7 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
115
Voted
BCSHCI
2007
15 years 5 months ago
Identifying web usability problems from eye-tracking data
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
Claudia Ehmke, Stephanie Wilson