7986 search results - page 277 / 1598 » Computational Science and its Applications |
170
click to vote
TLCA
1995
Springer
15 years 10 months ago
1995
Springer
We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
173
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
150
click to vote
CSE
2008
IEEE
15 years 6 months ago
2008
IEEE
to compile abstract experiment designs into enactable workflows that utilise the best available resources. The automation of this step and of the workflow enactment, hides the deta...
157
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of...
169
Voted
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...