Sciweavers

129 search results - page 22 / 26
» Tightness Time for the Linkage Learning Genetic Algorithm
Sort
View
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
15 years 3 months ago
Using GP to Model Contextual Human Behavior
To create a realistic environment, some simulations require simulated agents with human behavior pattern. Creating such agents with realistic behavior can be a tedious and time con...
Hans Fernlund, Avelino J. Gonzalez
TSMC
2008
147views more  TSMC 2008»
14 years 9 months ago
Tracking of Multiple Targets Using Online Learning for Reference Model Adaptation
Recently, much work has been done in multiple ob-4 ject tracking on the one hand and on reference model adaptation5 for a single-object tracker on the other side. In this paper, we...
Franz Pernkopf
AAAI
2010
14 years 11 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...
AEI
2004
150views more  AEI 2004»
14 years 9 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen
INFOCOM
2009
IEEE
15 years 4 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...