Sciweavers

16404 search results - page 884 / 3281
» A set coverage problem
Sort
View
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 11 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 11 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
Terry P. Riopka, Peter Bock
WSC
2007
15 years 10 months ago
Rare-event simulation for a multidimensional random walk with t distributed increments
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
Jose H. Blanchet, Jingchen Liu
ICPR
2010
IEEE
15 years 9 months ago
SemiCCA: Efficient Semi-Supervised Learning of Canonical Correlations
Canonical correlation analysis (CCA) is a powerful tool for analyzing multi-dimensional paired data. However, CCA tends to perform poorly when the number of paired samples is limit...
Akisato Kimura, Hirokazu Kameoka, Masashi Sugiyama...
COMPGEOM
2005
ACM
15 years 9 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...