Sciweavers

5316 search results - page 68 / 1064
» Which Search Problems Are Random
Sort
View
90
Voted
WWW
2004
ACM
16 years 1 months ago
Random surfer with back step
We present a novel link-based ranking algorithm RBS, which may be viewed as an extension of PageRank by back-step feature. Categories and Subject Descriptors H.3.3 [Information Se...
Marcin Sydow
111
Voted
ICML
2008
IEEE
16 years 1 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
119
Voted
IJHIS
2007
89views more  IJHIS 2007»
15 years 22 days ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
CP
2005
Springer
15 years 6 months ago
Multi-point Constructive Search
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
J. Christopher Beck
105
Voted
WWW
2004
ACM
16 years 1 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit