Find:

Searching for spa.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
1145 documents found. Only retrieving 125 documents (System busy - maximum reduced). Retrieving documents... Order: number of citations.

An Introduction to Least Commitment Planning - Weld (1994)   (Correct)   (167 citations)
1 2 The Planning Problem 2 3 Search through World Space 6 3.1 Progression :
:10 4 Search through the Space of Plans 11 4.1 Total Order Planning :
as a search problem, but the choice of search space is critical to performance. 2 The Planning
www-i5.informatik.rwth-aachen.de/LuFG/Lehre/WS97/PLAN/weld-plan-intro.ps.gz

Transactional Memory: Architectural Support for Lock-Free Data .. - Herlihy, Moss (1993)   (Correct)   (72 citations)
to NORMAL. When the transactional cache needs space for a new enName Kind Meaning New access READ
has certain inherent advantages: for any object that spans more than a single word of memory, techniques
this advantage is lost because the shared object spans more than one word, and therefore the only way
ftp.cs.umass.edu/pub/osl/papers/isca93.ps.Z

Beam Tracing Polygonal Objects - Heckbert, Hanrahan (1984)   (Correct)   (71 citations)
artifacts. It is difficult to take advantage of spa ial coherence because the shapes of reflections
paper we describe an algorithm that utilizes the f spatial coherence of polygonal environments by
by combining eatures of both image and object space hidden surface algo- w rithms. Instead of
www.cs.cmu.edu/afs/cs/user/ph/www/beam/beam.ps.gz

Moving Objects Databases: Issues and Solutions - Wolfson, Xu, Chamberlain, Jiang (1998)   (Correct)   (68 citations)
Generally, a query in MOD applications involves spa- tial objects (e.g. points, lines, regions,
the polygon P within the next 3 minutes"This is a spatial and temporal range query. The spatial range is
This is a spatial and temporal range query. The spatial range is the polygon P, and the temporal range
www.eecs.uic.edu/~wolfson/html/../mobile_ps/ssdmnew.ps

Architectural Support for Single Address Space Operating.. - Koldinger, Chase, Eggers (1992)   (Correct)   (53 citations)
Architectural Support for Single Address Space Operating Systems Eric J. Koldinger, Jeffrey S.
July Architectural Support for Single Address Space Operating Systems Eric J. Koldinger, Jeffrey S.
that support 64 bits of virtual address space. Such architectures facilitate fundamentally new
archive.cs.umbc.edu/pub/elm/sasos/prot-lookaside-buffer.ps.gz

The Structure of a Multi-Service Operating System - Roscoe (1995)   (Correct)   (44 citations)
Secretariat, Faculty of Computer Science, Vakgroep SPA, P.O. Box 217, 7500 AE Enschede, Netherlands. The
Sape J. Mullender, December 1992 92-3 Wide-Address Spaces -Exploring the Design Space, by Alberto
92-3 Wide-Address Spaces -Exploring the Design Space, by Alberto Bartoli, Sape J. Mullender, and
ftp.cl.cam.ac.uk/pegasus/paper94-05.ps.gz

Compiler Support for Garbage Collection in a Statically.. - Diwan, Moss, Hudson (1992)   (Correct)   (35 citations)
modes with two or more index registers, such as the SPARC. We use the term derived value for any value
each gc-point, the number of gc-points affects the space overhead of our scheme. Selection of gc-points
did not use any such arrays, so adding this space optimization would not affect the result we
ftp.cs.umass.edu/pub/osl/papers/sigplan92.ps.Z

A Comparative Performance Evaluation of Write Barrier .. - Hosking, Eliot.. (1992)   (Correct)   (32 citations)
compared with copying collectors that use semi-spaces. If b bytes are present in a generation before
and the survivors consume a bytes, then a semi-space scheme uses 2b bytes whereas our scheme uses
To handle such objects we provide a large object space (LOS)as suggested in [14]Indeed, it is
ftp.cs.umass.edu/pub/osl/papers/oopsla92.ps.Z

A Domain-Independent Algorithm for Plan Adaptation - Hanks (1995)   (Correct)   (29 citations)
plan generation. This paper presents an algorithm, spa (the "systematic plan adaptor"for plan
systematicity means that the algorithm explores the space of adaptations non-redundantly (in short, it
for two reasons. First, the adapter operates in a space of incomplete plans. 1 Each incomplete plan
ftp.cs.washington.edu/pub/ai/hanks-weld-spa-jair.ps.Z

Adaptive Error Control For Packet Video In The Internet - Bolot, Turletti (1996)   (Correct)   (28 citations)
using simple loss concealment techniques such as spa tial and temporal interpolation. Spatial
such as spa tial and temporal interpolation. Spatial interpolation reconstructs a missing piece in
region with the region specied by the vectors [6]Spatial and temporal in terpolation can be used
ftp-sop.inria.fr/rodeo/ivs/papers/icip96.ps.gz

Pegasus - Operating System Support for Distributed.. - Leslie, McAuley.. (1992)   (Correct)   (24 citations)
Secretariat, Faculty of Computer Science, Vakgroep SPA, P.O. Box 217, 7500 AE Enschede, Netherlands. They
disappears. The emergence of wide-address-space architectures is creating new ways of
physical memory much more easily by sharing address spaces as well. In shared memory, data can be shared
www.pegasus.esprit.ec.org/papers/paper92-02.ps

The Compositional Security Checker: A Tool for the.. - Focardi, al. (1997)   (Correct)   (23 citations)
them in the setting of Security Process Algebra (SPA, for short)then compared and classified them,
Non Deducibility on Compositions (BNDC ,for short)SPA is an extension of CCS [18] a language proposed
activities, simply called actions unlike CCS, in SPA actions belong to two different levels of
cs.unibo.it/~focardi/www/ps/TSE_Fo_Go.ps.gz

A Language-Independent Garbage Collector Toolkit - Hudson, Eliot, Moss, Diwan.. (1991)   (Correct)   (22 citations)
live for a moderately long time and take up a lot of space the python is the memory management system
1980]persistent objects, for buffer and address space management purposes. 2 Moving or deleting
age is encoded in the step. Our technique saves space for age counters in the objects and time for
ftp.cs.umass.edu/pub/osl/papers/tr9147.ps.Z

Using Collective Intelligence To Route Internet Traffic - Wolpert, al. (1999)   (Correct)   (19 citations)
COllective INtelligences (COINs) are large, sparsely connected recurrent neural networks, whose
running conventional shortest path algorithms (SPAs)However the microlearning occurs, they do not
to compare three algorithms. The first two are an SPA and a COIN. Both had "full knowledge" FK) of the
ic.arc.nasa.gov/ic/people/kagan/pubs/nips98_rout.ps.gz

Greedy approximation Algorithm For constructing Shortest Common.. - Ukkonen (1988)   (Correct)   (19 citations)
IN 47907 U.S.A. U.S.A. af1p@andrew.cmu.edu spa@cs.purdue.edu Abstract There has recently been a
for any stationary and ergodic sequence the state space \Sigma k of all sequences of length k can be
preprint. www.cs.purdue.edu/homes/spa/papers/scs.ps
www.cs.purdue.edu/homes/spa/papers/scs.ps

General Principles Of Learning-Based Multi-Agent Systems - Wolpert, Wheeler, al. (1999)   (Correct)   (18 citations)
have each router run a shortest path algorithm (SPA)i.e.each router routes its packets in the way
destinations most quickly. Unlike with a COIN, with SPA-based routing the routers have no concern for the
routing system has better throughputs than does an SPA-based system [22]In this paper we present a more
ic.arc.nasa.gov/ic/people/kagan/pubs/agents99_bar.ps.gz

Asymptotic Properties Of Data Compression And Suffix Trees - Szpankowski (1993)   (Correct)   (16 citations)
Theory 22, 1, 75-81 (1976)28] E.M. McCreight, A Space Economical Suffix Tree Construction Algorithm,
337-343 (1977)www.cs.purdue.edu/homes/spa/papers/suffix-it.ps
www.cs.purdue.edu/homes/spa/publications.html 30] W. Szpankowski, Asymptotic
www.cs.purdue.edu/homes/spa/papers/suffix-it.ps

Run-time Spatial Locality Detection and Optimization - Johnson, Merten, Hwu (1997)   (Correct)   (16 citations)
Run-time Spatial Locality Detection and Optimization Teresa L.
scheme which detects and adapts to varying spatial locality, dynamically adjusting the amount of
the amount of data fetched on a cache miss. The Spatial Locality Detection Table, introduced in this
ftp.crhc.uiuc.edu/pub/IMPACT/conference/micro-97-spatial.ps

Learning the Past Tense of English Verbs: The Symbolic Pattern.. - Ling (1994)   (Correct)   (16 citations)
a general-purpose Symbolic Pattern Associator (SPA) based upon the decision-tree learning algorithm
generalization ability between ANN models and the SPA under different representations. We conclude that
different representations. We conclude that the SPA generalizes the past tense of unseen verbs better
ftp.csd.uwo.ca/pub/ling/papers/jair-verb.ps.Z

A Construction and Analysis Tool Based on the.. - Hermanns.. (1996)   (Correct)   (12 citations)
1 Introduction Stochastic process algebras (SPA) have been introduced as an extension of classical
process algebras, the main characteristic of SPAs is constructivity, i.e. the ability to describe
forms the basis of the successful application of SPA for describing and analyzing systems of various
ftp.informatik.uni-erlangen.de/local/inf7/vs/tipp/tacas96.ps.gz

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC