1263 search results - page 196 / 253 » A* with Bounded Costs |
SAS
2001
Springer
14 years 15 days ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
FOCS
2000
IEEE
14 years 14 days ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...
IPPS
1999
IEEE
14 years 11 days ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
EDCC
1999
Springer
14 years 10 days ago
1999
Springer
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
ESOP
1999
Springer
14 years 10 days ago
1999
Springer
Safety of interoperation of program fragments written in different safe languages may fail when the languages have different systems of computational effects: an exception raised b...