Search Sciweavers | Sciweavers

66

TSP
2008

90views more TSP 2008»

Minimizing Transmit Power for Coherent Communications in Wireless Sensor Networks With Finite-Rate Feedback

14 years 9 months ago

We minimize average transmit power with finite-rate feedback for coherent communications in a wireless sensor network (WSN), where sensors communicate with a fusion center using ad...

Antonio G. Marqués, Xin Wang, Georgios B. G...

claim paper

Read More »

46

Voted

TSP
2008

105views more TSP 2008»

A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family

14 years 9 months ago

Download www.lss.supelec.fr

Minimal bounds on the mean square error (MSE) are generally used in order to predict the best achievable performance of an estimator for a given observation model. In this paper, w...

Alexandre Renaux, Philippe Forster, Pascal Larzaba...

claim paper

Read More »

60

click to vote

INFORMS
2007

83views more INFORMS 2007»

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)

14 years 9 months ago

Download www2.isye.gatech.edu

William J. Cook, Daniel G. Espinoza, Marcos Goycoo...

claim paper

Read More »

75

click to vote

APPROX
2008
Springer

108views Algorithms» more APPROX 2008»

Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP

14 years 11 months ago

Download people.csail.mit.edu

David R. Karger, Jacob Scott

claim paper

Read More »

72

click to vote

ORL
2008

86views more ORL 2008»

Searching the k-change neighborhood for TSP is W[1]-hard

14 years 9 months ago

Download www.cs.bme.hu

We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...

Dániel Marx

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers