1158 search results - page 152 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
176
click to vote
IPPS
2009
IEEE
16 years 23 days ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
173
click to vote
COMCOM
2004
15 years 6 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
182
click to vote
IPPS
2009
IEEE
16 years 23 days ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
191
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
154
click to vote
ESA
2009
Springer
16 years 21 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...