3616 search results - page 216 / 724 » Conditional Memory Ordering |
155
click to vote
CIA
2001
Springer
15 years 11 months ago
2001
Springer
We consider marketplaces where buyers and sellers iteratively encounter to trade. Given some specific trade conditions, the question that we address is what strategies should buy...
170
Voted
ISPD
2000
ACM
15 years 10 months ago
2000
ACM
In this paper, we propose a new clock tree synthesis method for semi-synchronous circuits. A clock tree obtained by the proposed method is a multi-level multi-way clock tree such ...
167
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
In order to accommodate the spectrum of configuration options currently required for competitive system infrastructures, many systems leverage heavy usage of C preprocessor contro...
170
click to vote
AAAI
1994
15 years 7 months ago
1994
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
153
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....