648 search results - page 53 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
115
click to vote
MP
1998
15 years 1 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
134
click to vote
DAC
2010
ACM
15 years 1 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the average memory access latency. Improving the cache hit rate can have significant positive impact on the per...
142
click to vote
ITICSE
2005
ACM
15 years 7 months ago
2005
ACM
concepts more concrete. The method has two main learning outcomes: • Language Specification – The goal of the assignment is to be able to build LEGO® creations on a standard g...
ENTCS
2007
15 years 1 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
137
click to vote
ASP
2005
Springer
15 years 7 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...