7123 search results - page 214 / 1425 » The Ordered Set of Rough Sets |
179
click to vote
JACM
2007
15 years 6 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
260
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
177
click to vote
ISCA
2006
IEEE
15 years 6 months ago
2006
IEEE
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
152
click to vote
HPCA
2009
IEEE
16 years 7 months ago
2009
IEEE
Realizing scalable cache coherence in the many-core era comes with a whole new set of constraints and opportunities. It is widely believed that multi-hop, unordered on-chip networ...
181
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...