Sciweavers

1224 search results - page 82 / 245
» Concept Search
Sort
View
JAIR
2000
123views more  JAIR 2000»
13 years 10 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
EOR
2006
135views more  EOR 2006»
13 years 10 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
CASCON
1996
72views Education» more  CASCON 1996»
13 years 11 months ago
A robot agent that can search
Object search is the task of eciently searching for a given 3D object in a given 3D environment by an agent equipped with a camera for target detection and, if the environment con...
Yiming Ye, John K. Tsotsos
CORR
2010
Springer
82views Education» more  CORR 2010»
13 years 10 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
PVLDB
2010
120views more  PVLDB 2010»
13 years 8 months ago
EXTRUCT: Using Deep Structural Information in XML Keyword Search
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Previous work has shown that current XML keyword search methods, although in...
Arash Termehchy, Marianne Winslett