31387 search results - page 5996 / 6278 » Abstracting abstract machines |
171
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
192
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
198
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
162
click to vote
CSCW
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we describe a study that explored the implications of the Social Translucence framework for designing systems that support communications at work. Two systems design...
179
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...