19866 search results - page 64 / 3974 » Computing all factorizations in *** |
115
click to vote
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
109
click to vote
SAT
2005
Springer
15 years 5 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
100
click to vote
BMCBI
2006
14 years 12 months ago
2006
Background: Proteins are comprised of one or several building blocks, known as domains. Such domains can be classified into families according to their evolutionary origin. Wherea...
SSIAI
2002
IEEE
15 years 4 months ago
2002
IEEE
2. Tracking traveling trajectory The traveling trajectory of eachvehicle is evaluatedfrom the analog images of 30 frames/sec.The computation of a traveling trajectory is mainly di...