Sciweavers

599 search results - page 84 / 120
» The traveling salesman problem
Sort
View
EJWCN
2010
119views more  EJWCN 2010»
13 years 2 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
IBERAMIA
2004
Springer
14 years 1 months ago
A Multi-robot Strategy for Rapidly Searching a Polygonal Environment
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
Alejandro Sarmiento, Rafael Murrieta-Cid, Seth Hut...
PPSN
1998
Springer
14 years 3 days ago
Integrated Facility Design Using an Evolutionary Approach with a Subordinate Network Algorithm
The facility design problem is a common one in manufacturing and service industries and has been studied extensively in the literature. However, restrictions on the scope of the de...
Bryan A. Norman, Alice E. Smith, Rifat Aykut Arapo...
MICRO
1990
IEEE
147views Hardware» more  MICRO 1990»
13 years 12 months ago
Motivation and framework for using genetic algorithms for microcode compaction
Genetic algorithms are a robust adaptive optimization technique based on a biological paradigm. They perform efficient search on poorly-defined spaces by maintaining an ordered po...
Steven J. Beaty, Darrell Whitley, Gearold Johnson