Sciweavers

193 search results - page 11 / 39
» Several ways to solve the MSO problem
Sort
View
INFORMATICALT
2000
96views more  INFORMATICALT 2000»
14 years 9 months ago
Investigation of Dead-Point Situations in the Simulation of Wet Film Evolution
The result of simulation of an idealized thin wet film connecting fixed points in the Euclidean plane is a length-minimizing curve. Gradually increasing the exterior pressure we ar...
Vydunas Saltenis
ICCAD
2006
IEEE
128views Hardware» more  ICCAD 2006»
15 years 6 months ago
Improvements to combinational equivalence checking
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
IJCAI
1989
14 years 11 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
ENTCS
2008
85views more  ENTCS 2008»
14 years 9 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
SASP
2009
IEEE
170views Hardware» more  SASP 2009»
15 years 4 months ago
Parade: A versatile parallel architecture for accelerating pulse train clustering
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...
Amin Ansari, Dan Zhang, Scott A. Mahlke