Sciweavers

225 search results - page 4 / 45
» On the Complexity of Approximating TSP with Neighborhoods an...
Sort
View
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 6 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
APPROX
2000
Springer
84views Algorithms» more  APPROX 2000»
13 years 10 months ago
On the relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
GRID
2003
Springer
13 years 11 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
SASO
2007
IEEE
14 years 18 hour ago
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
Rajesh K. Karmani, Timo Latvala, Gul Agha
TSP
2008
140views more  TSP 2008»
13 years 5 months ago
On the Dual-Tree Complex Wavelet Packet and M-Band Transforms
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...
I. Bayram, Ivan W. Selesnick