Sciweavers

3113 search results - page 216 / 623
» Efficiently Generating Efficient Generating Extensions in Pr...
Sort
View
ICLP
2009
Springer
16 years 5 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
SMI
2005
IEEE
109views Image Analysis» more  SMI 2005»
15 years 10 months ago
Practical Spherical Embedding of Manifold Triangle Meshes
Gotsman et al. (SIGGRAPH 2003) presented the first method to generate a provably bijective parameterization of a closed genus-0 manifold mesh to the unit sphere. This involves the...
Shadi Saba, Irad Yavneh, Craig Gotsman, Alla Sheff...
117
Voted
SAT
2005
Springer
111views Hardware» more  SAT 2005»
15 years 10 months ago
On Subsumption Removal and On-the-Fly CNF Simplification
Conjunctive Normal Form (CNF) Boolean formulas generated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simpl...
Lintao Zhang
ISLPED
2000
ACM
99views Hardware» more  ISLPED 2000»
15 years 9 months ago
Practical considerations of clock-powered logic
Recovering and reusing circuit energies that would otherwise be dissipated as heat can reduce the power dissipated by a VLSI chip. To accomplish this requires a power source that ...
William C. Athas
DASFAA
2010
IEEE
232views Database» more  DASFAA 2010»
15 years 9 months ago
Mining Rare Association Rules in the Datasets with Widely Varying Items' Frequencies
Rare association rule is an association rule consisting of rare items. It is difficult to mine rare association rules with a single minimum support (minsup) constraint because low ...
R. Uday Kiran, P. Krishna Reddy