13841 search results - page 174 / 2769 » Algorithms and Constraint Programming |
322
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
156
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
190
click to vote
CPAIOR
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
165
click to vote
ICALP
2005
Springer
16 years 16 hour ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
172
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...