Sciweavers

1914 search results - page 62 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
ICDAR
2009
IEEE
15 years 4 months ago
Effect of Improved Path Evaluation for On-line Handwritten Japanese Text Recognition
This paper describes a method of on-line handwritten Japanese text recognition by improved path evaluation. Based on a theoretical ground, the method evaluates the likelihood of c...
Bilan Zhu, Xiang-Dong Zhou, Cheng-Lin Liu, Masaki ...
ACL
2008
14 years 11 months ago
Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Generated SAT Analogy
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
Dmitry Davidov, Ari Rappoport
ECML
2006
Springer
15 years 1 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
15 years 4 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...