Sciweavers

1746 search results - page 264 / 350
» A linear implementation of PACMAN
Sort
View
106
Voted
PLDI
2005
ACM
15 years 9 months ago
Formal loop merging for signal transforms
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
Franz Franchetti, Yevgen Voronenko, Markus Pü...
123
Voted
SC
2005
ACM
15 years 9 months ago
Making Sequential Consistency Practical in Titanium
The memory consistency model in parallel programming controls the order in which operations performed by one thread may be observed by another. Language designers have been reluct...
Amir Kamil, Jimmy Su, Katherine A. Yelick
127
Voted
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 9 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
129
Voted
DALT
2005
Springer
15 years 9 months ago
Resource-Bounded Belief Revision and Contraction
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
Natasha Alechina, Mark Jago, Brian Logan
125
Voted
GD
2005
Springer
15 years 9 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong