3250 search results - page 418 / 650 » An Algorithm to Solve a Linear Program |
165
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
255
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
147
click to vote
ISSAC
2007
Springer
16 years 20 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
156
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
201
click to vote
SIGCSE
1991
ACM
15 years 10 months ago
1991
ACM
The development, specification, and use of a loop invariant are useful and underutilized tools in writing code to solve a problem or implement an algorithm. Invariants are especi...