Sciweavers

205 search results - page 24 / 41
» Engineering Planar Separator Algorithms
Sort
View
SMA
2008
ACM
149views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Exact arrangements on tori and Dupin cyclides
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
Eric Berberich, Michael Kerber
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 1 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
JCO
2010
101views more  JCO 2010»
14 years 8 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
TEC
2011
134views more  TEC 2011»
14 years 4 months ago
Differential Evolution: A Survey of the State-of-the-Art
—Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational step...
Swagatam Das, Ponnuthurai Nagaratnam Suganthan
KBSE
2010
IEEE
14 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer