349 search results - page 7 / 70 » Optimal Strategies for Reviewing Search Results |
137
click to vote
GECCO
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
NAACL
2001
15 years 1 months ago
2001
Developing dialogue systems is a complex process. In particular, designing efficient dialogue management strategies is often difficult as there are no precise guidelines to develo...
110
click to vote
COCOA
2010
Springer
14 years 9 months ago
2010
Springer
We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a well-suited framework for all cylcic strategies that result in...
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper we consider the problem of query and search in a network, e.g., searching for a specific node or a piece of data. We limit our attention to the class of TTL (tim...