Sciweavers

215 search results - page 27 / 43
» Practical Implications of New Results in Conservation of Opt...
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 8 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
COMCOM
2002
124views more  COMCOM 2002»
13 years 8 months ago
Thin-client Web access patterns: Measurements from a cache-busting proxy
This paper describes a new technique for measuring Web client request patterns and analyzes a large client trace collected using the new method. In this approach a modified proxy ...
Terence Kelly
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 9 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee
CORR
2010
Springer
207views Education» more  CORR 2010»
13 years 8 months ago
Collaborative Hierarchical Sparse Modeling
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
Pablo Sprechmann, Ignacio Ramírez, Guillerm...
COCOON
2010
Springer
14 years 1 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen