3680 search results - page 193 / 736 » cases 2010 |
174
click to vote
DT
2000
15 years 6 months ago
2000
f abstraction as applicable to break the problem's complexity, and innovating better techniques to address complexity of new microarchitectural features. Validation techniques...
175
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We explore the potential of hardware transactional memory (HTM) to improve concurrent algorithms. We illustrate a number of use cases in which HTM enables significantly simpler c...
179
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
156
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
189
click to vote
GG
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...