Sciweavers

1445 search results - page 86 / 289
» Uniformly Hard Languages
Sort
View
ICALP
1990
Springer
14 years 2 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
ECAI
2006
Springer
14 years 1 months ago
Unified Definition of Heuristics for Classical Planning
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
Jussi Rintanen
FOSSACS
2006
Springer
14 years 1 months ago
On the Relative Expressive Power of Asynchronous Communication Primitives
In this paper, we study eight asynchronous communication primitives, arising from the combination of three features: arity (monadic vs polyadic data), communication medium (messag...
Daniele Gorla
ISSTA
1991
ACM
14 years 1 months ago
Dynamic Slicing in the Presence of Unconstrained Pointers
Program slices are useful in debugging. Most work on program slicing to date has concentrated on nding slices of programs involving only scalar variables. Pointers and composite v...
Hiralal Agrawal, Richard A. DeMillo, Eugene H. Spa...
CTCS
1987
Springer
14 years 1 months ago
A Typed Lambda Calculus with Categorical Type Constructors
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...
Tatsuya Hagino