Sciweavers

520 search results - page 67 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 2 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
CEC
2010
IEEE
13 years 5 months ago
Improving evolutionary testing by means of efficiency enhancement techniques
TestFul is a novel evolutionary testing approach for object-oriented programs with complex internal states. In our preliminary experiments, it already outperformed some of the well...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
14 years 20 days ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
TCS
1998
13 years 8 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
ECML
2007
Springer
14 years 2 months ago
Generalization-Based Similarity for Conceptual Clustering
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...