Sciweavers

933 search results - page 146 / 187
» Extending Forward Checking
Sort
View
FMCAD
2009
Springer
14 years 3 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
DOCENG
2009
ACM
14 years 3 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
ICIP
2008
IEEE
14 years 2 months ago
A fast level set algorithm for shape-based segmentation with multiple selective priors
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
Rachid Fahmi, Aly A. Farag
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
14 years 2 months ago
OOPS for Motion Planning: An Online, Open-source, Programming System
— The success of sampling-based motion planners has resulted in a plethora of methods for improving planning components, such as sampling and connection strategies, local planner...
Erion Plaku, Kostas E. Bekris, Lydia E. Kavraki
SCAM
2007
IEEE
14 years 2 months ago
On Temporal Path Conditions in Dependence Graphs
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Andreas Lochbihler, Gregor Snelting