Sciweavers

794 search results - page 7 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ICCS
2005
Springer
14 years 2 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
DAGM
2005
Springer
14 years 2 months ago
A Fast Algorithm for Statistically Optimized Orientation Estimation
Filtering a signal with a finite impulse response (FIR) filter introduces dependencies between the errors in the filtered image due to overlapping filter masks. If the filteri...
Matthias Mühlich, Rudolf Mester
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 7 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
WWIC
2010
Springer
188views Communications» more  WWIC 2010»
14 years 1 months ago
Fair Quality of Experience (QoE) Measurements Related with Networking Technologies
This paper addresses the topic of Fair QoE measurements in networking. The research of new solutions in networking is oriented to improve the user experience. Any application or se...
Isaías Martinez-Yelmo, Isaac Seoane, Carmen...
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 2 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz