5316 search results - page 89 / 1064 » Which Search Problems Are Random |
102
click to vote
JAIR
2007
15 years 3 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
135
click to vote
JAIR
2007
15 years 3 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
133
click to vote
COR
2010
15 years 3 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
115
Voted
STOC
1990
ACM
15 years 7 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
105
click to vote
JUCS
2007
15 years 3 months ago
2007
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...