Sciweavers

4095 search results - page 446 / 819
» How to test a tree
Sort
View
CP
2006
Springer
15 years 9 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 9 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 9 months ago
Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP
In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over t...
L. Darrell Whitley, Marc D. Richards, J. Ross Beve...
EDBT
2000
ACM
15 years 9 months ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 9 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss