7006 search results - page 235 / 1402 » Approximation Algorithms |
119
click to vote
ICCAD
2001
IEEE
16 years 11 days ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
120
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
105
Voted
WSC
2004
15 years 4 months ago
2004
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
137
Voted
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...