Sciweavers

7167 search results - page 641 / 1434
» Answer Set Programming
Sort
View
171
Voted
JLP
2000
134views more  JLP 2000»
15 years 6 months ago
Abducing through negation as failure: stable models within the independent choice logic
The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics charact...
David Poole
MOR
2000
162views more  MOR 2000»
15 years 6 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
TVLSI
1998
80views more  TVLSI 1998»
15 years 6 months ago
Power optimization of core-based systems by address bus encoding
— This paper presents a solution to the problem of reducing the power dissipated by a digital system containing an intellectual proprietary core processor which repeatedly execut...
Luca Benini, Giovanni De Micheli, Enrico Macii, Ma...
188
Voted
ML
2010
ACM
159views Machine Learning» more  ML 2010»
15 years 4 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
OL
2010
77views more  OL 2010»
15 years 4 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre