Sciweavers

639 search results - page 42 / 128
» Integer Programming Models for Optimization Problems in Test...
Sort
View
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 3 months ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood
CGO
2003
IEEE
15 years 7 months ago
Dynamic Trace Selection Using Performance Monitoring Hardware Sampling
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
Howard Chen, Wei-Chung Hsu, Dong-yuan Chen
117
Voted
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
15 years 8 months ago
Genetically designed heuristics for the bin packing problem
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
Oana Muntean
108
Voted
JNW
2006
98views more  JNW 2006»
15 years 2 months ago
Efficient Distributed Algorithm for RWA Using Path Protection
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
Arunita Jaekel, Ying Chen
133
Voted
AIPS
2009
15 years 3 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...