379 search results - page 17 / 76 » The Graham-Knowlton Problem Revisited |
102
click to vote
ESOP
2012
Springer
13 years 9 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
101
click to vote
IWINAC
2005
Springer
15 years 7 months ago
2005
Springer
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
95
Voted
CPM
2003
Springer
15 years 7 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...
135
Voted
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
114
Voted
ISPW
2006
IEEE
15 years 8 months ago
2006
IEEE
In order to help knowledge acquirement and accumulation from past experiences, we propose a KFC (Knowledge Feedback Cycle) framework among engineers and researchers. Three tools (E...