38 search results - page 8 / 8 » The Program Structure Tree: Computing Control Regions in Lin... |
INFORMS
2010
13 years 3 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...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ISSTA
2000
ACM
13 years 9 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...