Sciweavers

64 search results - page 6 / 13
» Reducing the Size of NFAs by Using Equivalences and Preorder...
Sort
View
AAAI
2008
13 years 9 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
LPAR
2010
Springer
13 years 5 months ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
IDEAS
2006
IEEE
104views Database» more  IDEAS 2006»
14 years 1 months ago
Exploiting Indifference for Customization of Partial Order Skylines
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...
CASCON
2004
127views Education» more  CASCON 2004»
13 years 8 months ago
A quantitative analysis of the performance impact of specialized bytecodes in java
Java is implemented by 201 bytecodes that serve the same purpose as assembler instructions while providing object-file platform independence. A collection of core bytecodes provid...
Ben Stephenson, Wade Holst
IJON
2002
72views more  IJON 2002»
13 years 7 months ago
Modeling large cortical networks with growing self-organizing maps
Self-organizing computational models with specific intracortical connections can explain many features of visual cortex. However, due to their computation and memory requirements,...
James A. Bednar, Amol Kelkar, Risto Miikkulainen