4066 search results - page 45 / 814 » Improved Algorithms and Analysis for Secretary Problems and ... |
ECCC
2011
13 years 3 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate ...
CODES
2007
IEEE
14 years 3 months ago
2007
IEEE
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
SODA
2007
ACM
13 years 10 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
ICRA
1993
IEEE
14 years 27 days ago
1993
IEEE
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...