Sciweavers

2477 search results - page 118 / 496
» Approximate extended formulations
Sort
View
138
Voted
DAM
2008
78views more  DAM 2008»
15 years 4 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
TCS
2008
15 years 4 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang
130
Voted
GI
2009
Springer
15 years 1 months ago
Gaussian Mixture (GM) Passive Localization using Time Difference of Arrival (TDOA)
: This paper describes the passive emitter localization using Time Difference of Arrival (TDOA) measurements. It investigates various methods for estimating the solution of this no...
Regina Kaune
ICDE
2008
IEEE
155views Database» more  ICDE 2008»
16 years 5 months ago
Lattice Histograms: a Resilient Synopsis Structure
Despite the surge of interest in data reduction techniques over the past years, no method has been proposed to date that can always achieve approximation quality preferable to that...
Panagiotis Karras, Nikos Mamoulis
DAC
2009
ACM
16 years 5 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...