Sciweavers

1332 search results - page 91 / 267
» Combinatorial Algorithms
Sort
View
AAAI
1998
13 years 10 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CVPR
2009
IEEE
15 years 4 months ago
Half-integrality based algorithms for Cosegmentation of Images
We study the cosegmentation problem where the objective is to segment the same object (i.e., region) from a pair of images. The segmentation for each image can be cast using a p...
Chuck R. Dyer, Lopamudra Mukherjee, Vikas Singh
IPPS
2003
IEEE
14 years 2 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
GECCO
2003
Springer
120views Optimization» more  GECCO 2003»
14 years 2 months ago
New Usage of SOM for Genetic Algorithms
Abstract. Self-Organizing Map (SOM) is an unsupervised learning neural network and it is used for preserving the structural relationships in the data without prior knowledge. SOM h...
Jung Hwan Kim, Byung Ro Moon
HAIS
2009
Springer
14 years 12 days ago
A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection
Abstract. Cooperative Coevolution is a technique in the area of Evolutionary Computation. It has been applied to many combinatorial problems with great success. This contribution p...
Joaquín Derrac, Salvador García, Fra...