Sciweavers

1448 search results - page 23 / 290
» Restricted Stack Implementations
Sort
View
FLAIRS
2008
13 years 9 months ago
Adapting Decision Trees for Learning Selectional Restrictions
This paper describes the implementation of a system that automatically learns selectional restrictions for individual senses of polysemous verbs from subject-object relationships....
Sean R. Szumlanski, Fernando Gomez
ASPLOS
2006
ACM
14 years 1 months ago
A performance counter architecture for computing accurate CPI components
Cycles per Instruction (CPI) stacks break down processor execution time into a baseline CPI plus a number of miss event CPI components. CPI breakdowns can be very helpful in gaini...
Stijn Eyerman, Lieven Eeckhout, Tejas Karkhanis, J...
MICRO
1998
IEEE
75views Hardware» more  MICRO 1998»
13 years 11 months ago
Improving Prediction for Procedure Returns with Return-address-stack Repair Mechanisms
This paper evaluates several mechanisms for repairing the return-address stack after branch mispredictions. The return-address stack is a small but important structure for achievi...
Kevin Skadron, Pritpal S. Ahuja, Margaret Martonos...
PLDI
1990
ACM
13 years 11 months ago
Representing Control in the Presence of First-Class Continuations
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a h...
Robert Hieb, R. Kent Dybvig, Carl Bruggeman
CPC
2008
86views more  CPC 2008»
13 years 6 months ago
Enumeration Schemes for Restricted Permutations
Abstract. Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply...
Vincent Vatter