648 search results - page 111 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
INFORMS
2010
14 years 9 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
SIGCOMM
2006
ACM
15 years 4 months ago
2006
ACM
Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation betw...
109
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
SIGMOD
2012
ACM
13 years 1 months ago
2012
ACM
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
ASPLOS
2006
ACM
15 years 4 months ago
2006
ACM
Control-Flow Integrity (CFI) is a property that guarantees program control flow cannot be subverted by a malicious adversary, even if the adversary has complete control of data m...