Sciweavers

557 search results - page 40 / 112
» On the set multi-cover problem in geometric settings
Sort
View
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
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
Esther M. Arkin, Michael A. Bender, Sándor ...
EMNLP
2011
12 years 8 months ago
Entire Relaxation Path for Maximum Entropy Problems
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...
Moshe Dubiner, Yoram Singer
JMM2
2008
124views more  JMM2 2008»
13 years 9 months ago
Integrated Feature Selection and Clustering for Taxonomic Problems within Fish Species Complexes
As computer and database technologies advance rapidly, biologists all over the world can share biologically meaningful data from images of specimens and use the data to classify th...
Huimin Chen, Henry L. Bart Jr., Shuqing Huang
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
14 years 1 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...