Sciweavers

370 search results - page 9 / 74
» Independent Sets with Domination Constraints
Sort
View
VLDB
1987
ACM
86views Database» more  VLDB 1987»
13 years 11 months ago
Independent Database Schemes under Functional and Inclusion Dependencies
In a context considering in a unique framework all the relations in a database, by means of the notion of global consistency, independent database schemes allow enforcement of con...
Paolo Atzeni, Edward P. F. Chan
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 7 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 1 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
DAM
2011
13 years 2 months ago
Optimization problems in multiple subtree graphs
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
Danny Hermelin, Dror Rawitz
CADE
2006
Springer
14 years 7 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi