Sciweavers

2957 search results - page 146 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
15 years 8 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
182
Voted
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 8 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
AAAI
2010
15 years 6 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
IJCAI
2007
15 years 6 months ago
Incompleteness and Incomparability in Preference Aggregation
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
121
Voted
AAAI
2006
15 years 6 months ago
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nich...