Sciweavers

5316 search results - page 253 / 1064
» Which Search Problems Are Random
Sort
View
140
Voted
ECAI
2000
Springer
15 years 9 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida
PR
2008
144views more  PR 2008»
15 years 4 months ago
Regularized query classification using search click information
Hundreds of millions of users each day submit queries to the Web search engine. The user queries are typically very short which makes query understanding a challenging problem. In...
Xiaofei He, Pradhuman Jhala
SAC
2006
ACM
15 years 11 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
152
Voted
ILP
2004
Springer
15 years 10 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
15 years 10 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...