8780 search results - page 249 / 1756 » On the Feasibility of Consistent Computations |
207
click to vote
ICDCS
1997
IEEE
15 years 11 months ago
1997
IEEE
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...
205
click to vote
NMELP
1994
15 years 11 months ago
1994
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
207
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
195
click to vote
APWEB
2010
Springer
15 years 10 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...
197
click to vote
BIRD
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We propose a computational method for reconstructing metabolic networks. The method utilizes optimization techniques and graph traversal algorithms to discover a set of b...