986 search results - page 69 / 198 » Generalized Goal Programming: polynomial methods and applica... |
IWMM
2009
Springer
14 years 3 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
TACAS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
GECCO
2006
Springer
14 years 23 days ago
2006
Springer
Garbage collection can be a performance bottleneck in large distributed, multi-threaded applications. Applications may produce millions of objects during their lifetimes and may i...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...