7006 search results - page 992 / 1402 » Approximation Algorithms |
173
Voted
SSD
2005
Springer
16 years 8 days ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
169
click to vote
VLDB
2005
ACM
16 years 8 days ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
185
click to vote
SPAA
2003
ACM
16 years 1 days ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
179
click to vote
ICALP
2003
Springer
16 years 14 hour ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
165
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...