Sciweavers

1596 search results - page 51 / 320
» Human-Guided Simple Search
Sort
View
AAAI
1998
15 years 5 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
AAAI
1997
15 years 5 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
DAM
2008
135views more  DAM 2008»
15 years 3 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
15 years 10 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
GIR
2006
ACM
15 years 9 months ago
Handling Locations in Search Engine Queries
This paper proposes simple techniques for handling place references in search engine queries, an important aspect of geographical information retrieval. We address not only the de...
Bruno Martins, Mário J. Silva, Sérgi...