663 search results - page 83 / 133 » A Parallel Algorithm for Enumerating Combinations |
110
Voted
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
118
click to vote
IEEEPACT
1998
IEEE
15 years 6 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
123
Voted
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
155
Voted
PPSN
1994
Springer
15 years 6 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
101
Voted
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
Heterogeneous supercomputers with combined general purpose and accelerated CPUs promise to be the future major architecture due to their wideranging generality and superior perfor...