Sciweavers

1603 search results - page 109 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
ICML
2005
IEEE
16 years 4 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
HM
2005
Springer
87views Optimization» more  HM 2005»
15 years 9 months ago
A Taxonomy of Cooperative Search Algorithms
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
Mohammed El-Abd, Mohamed Kamel
SAGA
2001
Springer
15 years 8 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
IPPS
1997
IEEE
15 years 8 months ago
A Parallel Tabu Search Algorithm For The 0-1 Multidimensional Knapsack Problem
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Smaïl Niar, Arnaud Fréville
ANOR
2010
119views more  ANOR 2010»
15 years 4 months ago
Alternating local search based VNS for linear classification
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa