Sciweavers

599 search results - page 46 / 120
» The traveling salesman problem
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, ...
MDM
2009
Springer
125views Communications» more  MDM 2009»
14 years 2 months ago
Data Gathering by Mobile Mules in a Spatially Separated Wireless Sensor Network
While wireless sensor networks (WSNs) are typically targeted at large-scale deployment, due to many practical or inevitable reasons, a WSN may not always remain connected. In this...
Fang-Jing Wu, Chi-Fu Huang, Yu-Chee Tseng
CEC
2008
IEEE
14 years 2 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva
KES
2007
Springer
14 years 2 months ago
Calculating Optimal Decision Using Meta-level Agents for Multi-Agents in Networks
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
Anne Håkansson, Ronald L. Hartung
FOCS
2006
IEEE
14 years 2 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans