Sciweavers

3825 search results - page 241 / 765
» The Language of Time: A Reader
Sort
View
IPPS
2000
IEEE
15 years 11 months ago
Run-Time Support for Adaptive Load Balancing
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
POPL
2008
ACM
16 years 6 months ago
Extensible encoding of type hierarchies
The subtyping test consists of checking whether a type t is a descendant of a type r (Agrawal et al. 1989). We study how to perform such a test efficiently, assuming a dynamic hie...
Hamed Seiied Alavi, Seth Gilbert, Rachid Guerraoui
ICFP
2002
ACM
16 years 6 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
TIME
1994
IEEE
15 years 10 months ago
Hypothetical Reasoning from Situation Calculus to Event Calculus
Pinto and Reiter have argued that the Situation Calculus, improved with time handling axioms, subsumes the features of linear time temporal formalisms such as Event Calculus and I...
Alessandro Provetti