5316 search results - page 35 / 1064 » Which Search Problems Are Random |
86
Voted
ECCC
2010
15 years 23 days ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
155
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
116
Voted
AIED
2009
Springer
15 years 7 months ago
2009
Springer
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
87
Voted
SAGA
2007
Springer
15 years 6 months ago
2007
Springer
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
106
click to vote
SIAMDM
2008
15 years 18 days ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...