4218 search results - page 380 / 844 » Complete sets of cooperations |
212
Voted
HPDC
1998
IEEE
15 years 12 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
209
click to vote
LPNMR
1997
Springer
15 years 11 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
280
click to vote
WG
2010
Springer
15 years 6 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
190
click to vote
JGT
2011
15 years 2 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
179
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...