371 search results - page 58 / 75 » Partition Theorems and Computability Theory |
GECCO
2005
Springer
15 years 3 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...
69
Voted
IMC
2004
ACM
15 years 3 months ago
2004
ACM
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also ver...
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
LICS
2003
IEEE
15 years 2 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
106
click to vote
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...