Sciweavers

1299 search results - page 48 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
15 years 6 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
GCC
2005
Springer
15 years 3 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
MICCAI
2006
Springer
15 years 3 months ago
Simultaneous Stereoscope Localization and Soft-Tissue Mapping for Minimal Invasive Surgery
Minimally Invasive Surgery (MIS) has recognized benefits of reduced patient trauma and recovery time. In practice, MIS procedures present a number of challenges due to the loss of ...
Peter Mountney, Danail Stoyanov, Andrew Davison, G...
COCO
1998
Springer
100views Algorithms» more  COCO 1998»
15 years 1 months ago
Uniformly Hard Languages
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
Rodney G. Downey, Lance Fortnow
ENTCS
2006
172views more  ENTCS 2006»
14 years 9 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas