3894 search results - page 500 / 779 » Approximation Algorithms for Biclustering Problems |
153
click to vote
IPPS
2009
IEEE
15 years 11 months 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...
140
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
128
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...
138
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
144
click to vote
RTAS
2007
IEEE
15 years 10 months ago
2007
IEEE
Most of today’s real-time embedded systems consist of a heterogeneous mix of fully-programmable processors, fixed-function components or hardware accelerators, and partially-pr...