774 search results - page 91 / 155 » Process Discovery Using Integer Linear Programming |
151
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
132
click to vote
ICFP
1997
ACM
15 years 8 months ago
1997
ACM
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
139
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
This paper addresses the problem of extending the lifetime of a batterypowered mobile host in a client-server wireless network by using task migration and remote processing. This ...
160
click to vote
CCE
2005
15 years 3 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
121
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...