719 search results - page 26 / 144 » Solving Sparse Linear Constraints |
102
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
128
click to vote
SIAMSC
2008
15 years 11 days ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
UAI
2008
15 years 1 months ago
2008
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
123
Voted
INFORMS
1998
15 years 4 days ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
One subtask in constraint-driven placement is enforcing a set of orientation constraints on the devices being placed. Such constraints are created in order to, for example, implem...