Sciweavers

72 search results - page 5 / 15
» Minimal Contraction of Preference Relations
Sort
View
ASP
2005
Springer
14 years 3 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
COGSCI
2010
108views more  COGSCI 2010»
13 years 9 months ago
Do Grammars Minimize Dependency Length?
A well-established principle of language is that there is a preference for closely related words to be close together in the sentence. This can be expressed as a preference for de...
Daniel Gildea, David Temperley
CIKM
2010
Springer
13 years 8 months ago
Preference query evaluation over expensive attributes
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
AAAI
1992
13 years 10 months ago
Learning to Disambiguate Relative Pronouns
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
Claire Cardie