Sciweavers

2606 search results - page 406 / 522
» cost 2008
Sort
View
AINA
2008
IEEE
13 years 11 months ago
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
It is important to design an energy efficient data gathering tree structure for wireless sensor networks. As for the energy efficiency, network's overall energy consumption an...
Soonmok Kwon, Jeonggyu Kim, Cheeha Kim
ANNPR
2008
Springer
13 years 11 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
ANTSW
2008
Springer
13 years 11 months ago
Beanbag Robotics: Robotic Swarms with 1-DoF Units
Robotic swarm behavior is usually demonstrated using groups of robots, in which each robot in the swarm must possess full mobile capabilities, including the ability to control both...
David M. M. Kriesel, Eugene Cheung, Metin Sitti, H...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
APPROX
2008
Springer
100views Algorithms» more  APPROX 2008»
13 years 11 months ago
A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem
A long-standing conjecture in Combinatorial Optimization is that the integrality gap of the Held-Karp LP relaxation for the Asymmetric Traveling Salesman Problem (ATSP) is a consta...
Thành Nguyen