1991 search results - page 145 / 399 » Small Models of Large Machines |
119
Voted
ESA
2003
Springer
15 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
160
click to vote
AAAI
2008
15 years 7 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
163
click to vote
ECIR
2010
Springer
15 years 5 months ago
2010
Springer
Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to regist...
170
click to vote
ICMLA
2009
15 years 3 months ago
2009
State-of-the-art pattern recognition methods have difficulty dealing with problems where the dimension of the output space is large. In this article, we propose a new framework ba...
166
click to vote
ISPASS
2006
IEEE
15 years 11 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...