Sciweavers

272 search results - page 43 / 55
» An Approximation Algorithm for a Bottleneck Traveling Salesm...
Sort
View
ICUMT
2009
13 years 5 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
13 years 11 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...
CONSTRAINTS
2002
129views more  CONSTRAINTS 2002»
13 years 7 months ago
Cost-Based Arc Consistency for Global Cardinality Constraints
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
Jean-Charles Régin
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 7 months ago
Fitness Uniform Optimization
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...
Marcus Hutter, Shane Legg
INFOCOM
2008
IEEE
14 years 1 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff