Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JMLR
2010
120views more  JMLR 2010»
9 years 8 months ago
Effective Wrapper-Filter hybridization through GRASP Schemata
Of all of the challenges which face the selection of relevant features for predictive data mining or pattern recognition modeling, the adaptation of computational intelligence tec...
Mohamed Amir Esseghir
ICCV
2009
IEEE
9 years 11 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...
JCO
1998
136views more  JCO 1998»
10 years 1 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
HEURISTICS
1998
103views more  HEURISTICS 1998»
10 years 1 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ANOR
2002
110views more  ANOR 2002»
10 years 1 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
JUCS
2008
153views more  JUCS 2008»
10 years 1 months ago
Bus Network Optimization with a Time-Dependent Hybrid Algorithm
: This paper describes a new hybrid technique that combines a Greedy Randomized Adaptive Search Procedure (GRASP) and a genetic algorithm with simulation features in order to solve...
Ana C. Olivera, Mariano Frutos, Jessica Andrea Car...
EOR
2010
116views more  EOR 2010»
10 years 1 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
10 years 5 months ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
EVOW
2004
Springer
10 years 6 months ago
A Hierarchical Social Metaheuristic for the Max-Cut Problem
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
Abraham Duarte, Felipe Fernández, Án...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
10 years 8 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
books