11740 search results - page 135 / 2348 » More Problems in Rewriting |
110
Voted
EOR
2008
15 years 26 days ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
EOR
2007
15 years 23 days ago
2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
104
click to vote
TCBB
2008
15 years 22 days ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
113
click to vote
SIAMMAX
2010
14 years 7 months ago
2010
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...
ICTAI
2009
IEEE
15 years 7 months ago
2009
IEEE
Inference in constraint programming is usually based on the deductions generated by individual constraints which are then communicated to other constraints through domain filteri...