Sciweavers

3422 search results - page 177 / 685
» Random Subset Optimization
Sort
View
ICCV
2003
IEEE
16 years 7 months ago
Eye Design in the Plenoptic Space of Light Rays
Natural eye designs are optimized with regard to the tasks the eye-carrying organism has to perform for survival. This optimization has been performed by the process of natural ev...
Cornelia Fermüller, Jan Neumann, Yiannis Aloi...
160
Voted
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 9 months ago
New On-Line Algorithms for the Page Replication Problem
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
Susanne Albers, Hisashi Koga
171
Voted
IPL
2000
146views more  IPL 2000»
15 years 4 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
SIGCOMM
2010
ACM
15 years 5 months ago
EffiCuts: optimizing packet classification for memory and throughput
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
Balajee Vamanan, Gwendolyn Voskuilen, T. N. Vijayk...
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 5 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed