774 search results - page 75 / 155 » Process Discovery Using Integer Linear Programming |
122
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
113
click to vote
NETWORKS
2008
15 years 2 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
95
Voted
FMSD
2007
15 years 2 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
107
click to vote
UAI
2004
15 years 3 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
169
click to vote
HASKELL
2006
ACM
15 years 8 months ago
2006
ACM
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...