301 search results - page 48 / 61 » The k-Median Problem for Directed Trees |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
WCNC
2008
IEEE
14 years 1 months ago
2008
IEEE
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
CPAIOR
2005
Springer
14 years 1 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...