648 search results - page 58 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
140
click to vote
ICSE
2010
IEEE-ACM
15 years 3 months ago
2010
IEEE-ACM
The feature list of modern IDEs is steadily growing and mastering these tools becomes more and more demanding, especially for novice programmers. Despite their remarkable capabili...
VLSID
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
106
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
104
click to vote
PASTE
2010
ACM
15 years 6 months ago
2010
ACM
We present a novel technique that identifies the source compiler of program binaries, an important element of program provenance. Program provenance answers fundamental questions...
130
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...