2434 search results - page 167 / 487 » Algorithmic Randomness of Closed Sets |
159
click to vote
SPAA
1998
ACM
15 years 7 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
153
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...
120
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
103
click to vote
CATS
2008
15 years 5 months ago
2008
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
112
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...