Sciweavers

344 search results - page 16 / 69
» The Santa Claus problem
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 1 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
FSTTCS
2004
Springer
14 years 3 months ago
Real-Counter Automata and Their Decision Problems
d Abstract) Zhe Dang ¡£¢¤¢ , Oscar H. Ibarra ¥ , Pierluigi San Pietro ¦ , and Gaoyan Xie ¡ § School of Electrical Engineering and Computer Science Washington State Univers...
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, G...
AAAI
2000
13 years 11 months ago
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
Chu Min Li
KR
2004
Springer
14 years 3 months ago
Condensed Representations for Inductive Logic Programming
When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various t...
Luc De Raedt, Jan Ramon
IPL
2008
111views more  IPL 2008»
13 years 9 months ago
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
Markus Bläser, Thomas Heynen, Bodo Manthey