Sciweavers

153 search results - page 5 / 31
» Improved combination of online algorithms for acceptance and...
Sort
View
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
13 years 11 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
AAAI
2007
13 years 10 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
13 years 9 months ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Anil Kamath, Omri Palmon, Serge A. Plotkin
ICMCS
2006
IEEE
161views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Improved Similarity-Based Online Feature Selection in Region-Based Image Retrieval
To bridge the gap between high level semantic concepts and low level visual features in content-based image retrieval (CBIR), online feature selection is really required. An effec...
Fei Li, Qionghai Dai, Wenli Xu
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 9 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg