Sciweavers

1204 search results - page 121 / 241
» Termination of Polynomial Programs
Sort
View
116
Voted
VL
1996
IEEE
130views Visual Languages» more  VL 1996»
15 years 4 months ago
Seeing Systolic Computations in a Video Game World
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...
Kenneth M. Kahn
JFP
2000
91views more  JFP 2000»
15 years 16 days ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
111
Voted
WDAG
2007
Springer
132views Algorithms» more  WDAG 2007»
15 years 6 months ago
Detecting Temporal Logic Predicates on Distributed Computations
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
Vinit A. Ogale, Vijay K. Garg
111
Voted
IWPEC
2004
Springer
15 years 6 months ago
The Minimum Weight Triangulation Problem with Few Inner Points
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
Michael Hoffmann, Yoshio Okamoto
86
Voted
ICALP
2010
Springer
15 years 2 months ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...