12519 search results - page 113 / 2504 » Approximation Problems Categories |
161
click to vote
AMC
2004
15 years 6 months ago
2004
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
150
click to vote
DAM
2006
15 years 6 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
204
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
194
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
154
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
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...