Sciweavers

3136 search results - page 163 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CEC
2007
IEEE
16 years 22 days ago
Combine and compare evolutionary robotics and reinforcement Learning as methods of designing autonomous robots
—The purpose of this paper is to present a comparison between two methods of building adaptive controllers for robots. In spite of the wide range of techniques which are used for...
Sergiu Goschin, Eduard Franti, Monica Dascalu, San...
ICC
2009
IEEE
152views Communications» more  ICC 2009»
15 years 4 months ago
System Spectral Efficiency and Stability of 3G Networks: A Comparative Study
CDMA2000, WCDMA and WiMAX are three widely used 3G technologies. Since they share the same goal, which is to provide broader coverage and higher throughput in 3G networks, an impar...
Yuehong Gao, Xin Zhang, Yuming Jiang, Jeong-woo Ch...
CIKM
2011
Springer
14 years 6 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
15 years 10 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman
NA
2006
84views more  NA 2006»
15 years 6 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet