3119 search results - page 333 / 624 » General Default Logic |
173
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
151
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
150
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
In this paper, we present a new linear-time retiming algorithm that produces near-optimal results. Our implementation is specifically targeted at Altera's Stratix [1] FPGAbas...
169
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
185
Voted
WWW
2006
ACM
16 years 7 months ago
2006
ACM
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...