1949 search results - page 276 / 390 » Random graphs on surfaces |
114
Voted
CSCLP
2005
Springer
15 years 9 months 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...
156
click to vote
PATAT
2000
Springer
15 years 7 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...
172
Voted
ACST
2006
15 years 5 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...
143
Voted
NIPS
2001
15 years 5 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...
110
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...