3055 search results - page 59 / 611 » Randomized Search Trees |
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
CHI
1997
ACM
14 years 1 months ago
1997
ACM
To understand how people search for a known target item in an unordered pull-down menu, this research presents cognitive models that vary serial versus parallel processing of menu...
INFORMATICALT
2007
13 years 9 months ago
2007
Abstract. The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for ...
AI
2001
Springer
14 years 1 months ago
2001
Springer
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...