3946 search results - page 45 / 790 » The computational complexity of choice sets |
SIGCSE
2002
ACM
14 years 11 months ago
2002
ACM
Most courses on Discrete Mathematics are designed to emphasize problem solving, in general. When the goal is to cover the content, the learning and understanding takes a second pl...
115
click to vote
AICT
2005
IEEE
15 years 5 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
CAGD
2010
14 years 12 months ago
2010
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributed computing settings. Using availability data gathered from three...
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...