973 search results - page 110 / 195 » New Bounds on Crossing Numbers |
182
click to vote
CLUSTER
2004
IEEE
15 years 6 months ago
2004
IEEE
An increasing number of applications are being developed using distributed object computing (DOC) middleware, such as CORBA. Many of these applications require the underlying midd...
165
click to vote
COCOA
2007
Springer
16 years 15 days 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...
146
click to vote
ARSCOM
2007
15 years 6 months ago
2007
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
190
click to vote
ICDCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
145
click to vote
ICS
1999
Tsinghua U.
15 years 10 months ago
1999
Tsinghua U.
This paper presents an investigation into local mechanisms and scheduling policies that allow guest processes to efficiently exploit otherwise-idle workstation resources. Unlike t...