Sciweavers

365 search results - page 25 / 73
» Numerical Solving of Geometric Constraints
Sort
View
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 6 months ago
Concave Programming Upper Bounds on the Capacity of 2-D Constraints
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
Ido Tal, Ron M. Roth
TIT
2011
116views more  TIT 2011»
13 years 2 months ago
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
Ido Tal, Ron M. Roth
SIAMMAX
2010
156views more  SIAMMAX 2010»
13 years 2 months ago
Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...
Roland Herzog, Ekkehard W. Sachs
CP
2010
Springer
13 years 6 months ago
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter var...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
MMAS
2010
Springer
13 years 2 months ago
A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
Dorit Ron, Ilya Safro, Achi Brandt