Sciweavers

1160 search results - page 40 / 232
» A Colour Object Search Algorithm
Sort
View
COR
2011
14 years 9 months ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
104
Voted
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
15 years 3 months ago
Objective reduction using a feature selection technique
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
Antonio López Jaimes, Carlos A. Coello Coel...
IBERAMIA
2004
Springer
15 years 7 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...
120
Voted
ICALP
2003
Springer
15 years 7 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
98
Voted
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 6 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan