4110 search results - page 63 / 822 » Efficient algorithms for the 2-gathering problem |
129
Voted
CCR
2006
15 years 3 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
100
click to vote
AIPS
1998
15 years 5 months ago
1998
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
126
Voted
AMC
2005
15 years 3 months ago
2005
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
180
Voted
IMCSIT
2010
15 years 1 months ago
2010
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
148
click to vote
FAW
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...