2976 search results - page 242 / 596 » On the bounded integer programming |
147
click to vote
AMAI
2004
Springer
15 years 11 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 ...
165
click to vote
CC
2004
Springer
15 years 11 months ago
2004
Springer
We present an algorithm for counting the number of integer solutions to selected free variables of a Presburger formula. We represent the Presburger formula as a deterministic fin...
153
click to vote
DIS
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
165
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
158
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...