1542 search results - page 230 / 309 » The metamathematics of random graphs |
174
click to vote
AIRWEB
2005
Springer
16 years 25 days ago
2005
Springer
We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
170
click to vote
CSCLP
2005
Springer
16 years 22 days ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
219
click to vote
PATAT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
236
click to vote
ACST
2006
15 years 8 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
207
click to vote
NIPS
2001
15 years 8 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...