Sciweavers

5606 search results - page 616 / 1122
» Randomization Techniques for Graphs.
Sort
View
FUIN
2007
90views more  FUIN 2007»
15 years 7 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
JAR
2007
132views more  JAR 2007»
15 years 7 months ago
Visualizing SAT Instances and Runs of the DPLL Algorithm
SAT-solvers have turned into essential tools in many areas of applied logic like, for example, hardware verification or satisfiability checking modulo theories (SMT). And althoug...
Carsten Sinz
TOG
2008
137views more  TOG 2008»
15 years 7 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
NJC
2000
99views more  NJC 2000»
15 years 6 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
SPLC
2010
15 years 5 months ago
Improving the Testing and Testability of Software Product Lines
Abstract. Software Product Line (SPL) engineering offers several advantages in the development of families of software products. There is still a need, however, for better underst...
Isis Cabral, Myra B. Cohen, Gregg Rothermel