Sciweavers

1940 search results - page 191 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
EVOW
2008
Springer
15 years 8 months ago
Multiobjective Prototype Optimization with Evolved Improvement Steps
Recently, a new iterative optimization framework utilizing an evolutionary algorithm called "Prototype Optimization with Evolved iMprovement Steps" (POEMS) was introduced...
Jirí Kubalík, Richard Mordinyi, Stef...
CP
2007
Springer
16 years 22 days ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 3 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
16 years 21 days ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
16 years 20 days ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank