874 search results - page 79 / 175 » Computing Weighted Solutions in Answer Set Programming |
120
click to vote
ICFP
2007
ACM
16 years 24 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
120
Voted
DISOPT
2008
15 years 11 days ago
2008
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
125
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
110
click to vote
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
129
Voted
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...