1802 search results - page 111 / 361 » Complexity Theory for Operators in Analysis |
158
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
181
click to vote
KBSE
1999
IEEE
15 years 10 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
155
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
160
click to vote
PODS
2000
ACM
15 years 10 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
280
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
In prior work we introduced a pure type assignment system that encompasses a rich set of property types, including intersections, unions, and universally and existentially quantif...