Sciweavers

1963 search results - page 64 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
139
Voted
AAAI
2007
15 years 5 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
116
Voted
IJCAI
2003
15 years 4 months ago
Efficient Execution of Recursive Integration Plans
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
Snehal Thakkar, Craig A. Knoblock
127
Voted
ICCAD
1994
IEEE
105views Hardware» more  ICCAD 1994»
15 years 7 months ago
Register assignment through resource classification for ASIP microcode generation
Application Specific Instruction-Set Processors (ASIPs) offer designers the ability for high-speed data and control processing with the added flexibility needed for late design sp...
Clifford Liem, Trevor C. May, Pierre G. Paulin
ICS
2009
Tsinghua U.
15 years 9 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
118
Voted
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 5 days ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang