2905 search results - page 163 / 581 » Formal Memetic Algorithms |
CAV
2009
Springer
14 years 11 months ago
2009
Springer
With the availability of multi-core processors and large-scale computing clusters, the study of parallel algorithms has been revived throughout the industry. We present a portfolio...
CAV
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
FORMATS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
STACS
1991
Springer
14 years 1 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
AIPS
1994
13 years 11 months ago
1994
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presente...