Sciweavers

152 search results - page 8 / 31
» An Experimental Study of Random Knapsack Problems
Sort
View
GECCO
2003
Springer
134views Optimization» more  GECCO 2003»
13 years 12 months ago
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
Andrew Lim, Zhou Xu
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 1 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 26 days ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
JAIR
2010
99views more  JAIR 2010»
13 years 5 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
JAIR
2007
95views more  JAIR 2007»
13 years 6 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson