4378 search results - page 64 / 876 » On the Complexity of Ordered Colourings |
150
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
151
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
146
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
182
click to vote
AAAI
2008
15 years 8 months ago
2008
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
161
click to vote
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...