274 search results - page 5 / 55 » Watermarking integer linear programming solutions |
APN
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
CANDC
2005
ACM
13 years 7 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
Recent advancement in peer-to-peer (P2P) technologies has enabled a wide range of new applications. In this paper, we present mixed integer programming (MIP) formulations to analy...