Sciweavers

302 search results - page 19 / 61
» Problem space promotion and its evaluation as a technique fo...
Sort
View
ICALP
2009
Springer
14 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ECCV
2010
Springer
14 years 1 days ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
CORR
2004
Springer
108views Education» more  CORR 2004»
13 years 8 months ago
Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
Kumara Sastry, David E. Goldberg, Martin Pelikan
CLUSTER
2009
IEEE
13 years 6 months ago
Coordinating the use of GPU and CPU for improving performance of compute intensive applications
GPUs have recently evolved into very fast parallel co-processors capable of executing general purpose computations extremely efficiently. At the same time, multi-core CPUs evolutio...
George Teodoro, Rafael Sachetto Oliveira, Olcay Se...
JMLR
2010
162views more  JMLR 2010»
13 years 3 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...