Sciweavers

9119 search results - page 141 / 1824
» A Simultaneous Search Problem
Sort
View
154
Voted
TSP
2008
167views more  TSP 2008»
15 years 1 months ago
Multi-Task Learning for Analyzing and Sorting Large Databases of Sequential Data
A new hierarchical nonparametric Bayesian framework is proposed for the problem of multi-task learning (MTL) with sequential data. The models for multiple tasks, each characterize...
Kai Ni, John William Paisley, Lawrence Carin, Davi...
145
Voted
CP
1999
Springer
15 years 7 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
111
Voted
CEC
2010
IEEE
15 years 5 days ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
110
Voted
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 7 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo
103
Voted
EOR
2008
78views more  EOR 2008»
15 years 2 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake