Sciweavers

787 search results - page 120 / 158
» Polynomial Constants are Decidable
Sort
View
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 3 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
ICALP
2005
Springer
14 years 3 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
ISAAC
2005
Springer
110views Algorithms» more  ISAAC 2005»
14 years 3 months ago
Minimum Entropy Coloring
Abstract We study an information-theoretic variant of the graph coloring problem in which the objective function to minimize is the entropy of the coloring. The minimum entropy of ...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
14 years 3 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
AINA
2010
IEEE
14 years 2 months ago
A Quadratic, Complete, and Minimal Consistency Diagnosis Process for Firewall ACLs
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca