1511 search results - page 103 / 303 » Randomness, lowness and degrees |
163
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
189
click to vote
IJAHUC
2008
15 years 6 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
136
click to vote
RSA
2006
15 years 6 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
145
click to vote
JAIR
1998
15 years 6 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
185
click to vote
COCOA
2009
Springer
16 years 27 days ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...