4860 search results - page 483 / 972 » SNPs Problems, Complexity, and Algorithms |
123
click to vote
ICML
1996
IEEE
16 years 5 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
131
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
139
Voted
EMO
2006
Springer
15 years 7 months ago
2006
Springer
1 In most real world optimization problems several optimization goals have to be considered in parallel. For this reason, there has been a growing interest in Multi-Objective Optim...
145
click to vote
DLOG
2007
15 years 6 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
131
click to vote
ICAI
2003
15 years 5 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...