4110 search results - page 105 / 822 » Efficient algorithms for the 2-gathering problem |
132
Voted
CCE
2004
15 years 4 months ago
2004
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
144
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
134
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
115
click to vote
AAAI
1994
15 years 5 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
122
click to vote
ANOR
2008
15 years 4 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...