Sciweavers

944 search results - page 88 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
PAMI
2011
14 years 5 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 3 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
GECCO
2007
Springer
144views Optimization» more  GECCO 2007»
15 years 2 months ago
Multiobjective network design for realistic traffic models
Network topology design problems find application in several real life scenarios. However, most designs in the past either optimize for a single criterion like delay or assume sim...
Nilanjan Banerjee, Rajeev Kumar
DCOSS
2011
Springer
13 years 10 months ago
STARS: Static relays for multi-robot real-time search and monitoring
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
Yuanteng Pei, Matt W. Mutka
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
15 years 11 months ago
Scalable Rule-Based Gene Expression Data Classification
Abstract-- Current state-of-the-art association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (i...
Mark A. Iwen, Willis Lang, Jignesh M. Patel