206 search results - page 41 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
DAM
2008
13 years 5 months ago
2008
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main con...
ICS
2011
Tsinghua U.
12 years 9 months ago
2011
Tsinghua U.
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
GIS
2005
ACM
14 years 6 months ago
2005
ACM
Numerous raster maps are available on the Internet, but the geographic coordinates of the maps are often unknown. In order to determine the precise location of a raster map, we ex...
SIGCOMM
2003
ACM
13 years 11 months ago
2003
ACM
Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...