1017 search results - page 17 / 204 » Register computations on ordinals |
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
HPCA
1998
IEEE
13 years 12 months ago
1998
IEEE
A novel dynamic register renaming approach is proposed in this work. The key idea of the novel scheme is to delay the allocation of physical registers until a late stage in the pi...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
CDC
2009
IEEE
14 years 11 days ago
2009
IEEE
— Due to the uncertainty in the forecasting of load patterns, security dispatching finds the generation pattern, which is the most economic and passes all N − 1 contingencies ...