Sciweavers

2050 search results - page 49 / 410
» constraints 2010
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 6 months ago
Active Integrity Constraints and Revision Programming
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...
Luciano Caroprese, Miroslaw Truszczynski
ECCC
2006
145views more  ECCC 2006»
13 years 7 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
JGO
2010
115views more  JGO 2010»
13 years 6 months ago
Maximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Gilbert Strang
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...
EOR
2002
105views more  EOR 2002»
13 years 7 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler