206 search results - page 22 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
DATE
1999
IEEE
15 years 1 months ago
1999
IEEE
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
100
click to vote
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— We study the problem of designing motionplanning and sensor assignment strategies for tracking multiple targets with a mobile sensor network. We focus on triangulation ...
BIRTHDAY
2009
Springer
15 years 1 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
FOCS
2007
IEEE
15 years 1 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...