Sciweavers

774 search results - page 66 / 155
» Process Discovery Using Integer Linear Programming
Sort
View
111
Voted
ATMOS
2007
152views Optimization» more  ATMOS 2007»
15 years 3 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
120
Voted
RECOMB
2006
Springer
16 years 2 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
109
Voted
INFOCOM
2009
IEEE
15 years 8 months ago
Virtual Network Embedding with Coordinated Node and Link Mapping
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Ra...
SAT
2005
Springer
138views Hardware» more  SAT 2005»
15 years 7 months ago
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
Vasco M. Manquinho, João P. Marques Silva
ICML
2006
IEEE
15 years 8 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup