478 search results - page 48 / 96 » Approximation algorithms for general packing problems and th... |
GECCO
2007
Springer
14 years 17 days ago
2007
Springer
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
PPDP
2005
Springer
14 years 2 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
PAKDD
2009
ACM
14 years 5 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...