Sciweavers

8094 search results - page 309 / 1619
» Improvements in Formula Generalization
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 10 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 10 months ago
Computing the epistasis variance of large-scale traveling salesman problems
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
Dong-il Seo, Byung Ro Moon
LPNMR
2005
Springer
15 years 10 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
ATAL
2004
Springer
15 years 10 months ago
A Complete and Decidable Logic for Resource-Bounded Agents
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
Natasha Alechina, Brian Logan, Mark Whitsey
ICALP
2004
Springer
15 years 10 months ago
Model Checking with Multi-valued Logics
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...
Glenn Bruns, Patrice Godefroid