Sciweavers

162 search results - page 19 / 33
» Advanced Techniques for Answer Set Programming
Sort
View
AAAI
2000
13 years 9 months ago
Dynamic Case Creation and Expansion for Analogical Reasoning
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
Thomas Mostek, Kenneth D. Forbus, Cara Meverden
FOCS
2005
IEEE
14 years 1 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
CGO
2006
IEEE
14 years 1 months ago
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
Zhelong Pan, Rudolf Eigenmann
GD
1998
Springer
13 years 12 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
CORR
2006
Springer
143views Education» more  CORR 2006»
13 years 7 months ago
A Knowledge-Based Approach for Selecting Information Sources
Through the Internet and the World-Wide Web, a vast number of information sources has become available, which offer information on various subjects by different providers, often i...
Thomas Eiter, Michael Fink, Hans Tompits