Sciweavers

1224 search results - page 245 / 245
» Detectability of the Order of Operations: An Information The...
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 9 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
AVI
2004
13 years 6 months ago
Integrating expanding annotations with a 3D explosion probe
Understanding complex 3D virtual models can be difficult, especially when the model has interior components not initially visible and ancillary text. We describe new techniques fo...
Henry Sonnet, M. Sheelagh T. Carpendale, Thomas St...
IOR
2007
106views more  IOR 2007»
13 years 5 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
KBSE
2010
IEEE
13 years 3 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