Sciweavers

5624 search results - page 196 / 1125
» On Conditional Covering Problem
Sort
View
FOCS
2006
IEEE
16 years 18 days ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
PPSN
2004
Springer
15 years 12 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
AE
1999
Springer
15 years 10 months ago
Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
Jens Gottlieb, Günther R. Raidl
CAIP
1995
Springer
200views Image Analysis» more  CAIP 1995»
15 years 10 months ago
The Color Constancy Problem: An Illumination Invariant Mapping Approach
Abstract. We suggest a novel approach to the Color Constancy Problem for multispectral imagery. Our approach is based on a dichromatic illumination model and lters out all spectral...
Rafael Wiemker
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
15 years 8 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary