Sciweavers

4983 search results - page 912 / 997
» order 2008
Sort
View
SIGPLAN
2002
13 years 8 months ago
Write barrier removal by static analysis
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...
Karen Zee, Martin C. Rinard
TPDS
1998
92views more  TPDS 1998»
13 years 8 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
TSE
1998
83views more  TSE 1998»
13 years 8 months ago
Cost-Effective Analysis of In-Place Software Processes
—Process studies and improvement efforts typically call for new instrumentation on the process in order to collect the data they have deemed necessary. This can be intrusive and ...
Jonathan E. Cook, Lawrence G. Votta, Alexander L. ...
UMUAI
1998
157views more  UMUAI 1998»
13 years 8 months ago
Bayesian Models for Keyhole Plan Recognition in an Adventure Game
We present an approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users’ plans and...
David W. Albrecht, Ingrid Zukerman, Ann E. Nichols...
SPEECH
2002
112views more  SPEECH 2002»
13 years 8 months ago
Relating dialogue games to information state
This paper1 discusses the use of `conversational' or `dialogue games' as a basis for building dialogue systems. We give a tutorial overview of some recent attempts to re...
Stephen G. Pulman