Sciweavers

1220 search results - page 108 / 244
» Restricting grammatical complexity
Sort
View
DATE
2002
IEEE
84views Hardware» more  DATE 2002»
14 years 23 days ago
Performance-Area Trade-Off of Address Generators for Address Decoder-Decoupled Memory
Multimedia applications are characterized by a large number of data accesses and complex array index manipulations. The built-in address decoder in the RAM memory model commonly u...
Sambuddhi Hettiaratchi, Peter Y. K. Cheung, Thomas...
FOCS
2002
IEEE
14 years 23 days ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan
WORDS
2002
IEEE
14 years 22 days ago
Auction System Design Using Open Multithreaded Transactions
Open Multithreaded Transactions form an advanced transaction model that provides features for controlling and structuring not only accesses to objects, as usual in transaction sys...
Jörg Kienzle, Alfred Strohmeier, Alexander B....
APLAS
2000
ACM
14 years 5 days ago
A New Criterion for Safe Program Transformations
Previous studies on safety of program transformations with respect to performance considered two criteria: preserving performance within a constant factor and preserving complexit...
Yasuhiko Minamide
CONCUR
2000
Springer
14 years 4 days ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky