Sciweavers

1756 search results - page 151 / 352
» Directed scale-free graphs
Sort
View
JCT
2006
110views more  JCT 2006»
13 years 8 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 8 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
STTT
2008
86views more  STTT 2008»
13 years 8 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
PC
2000
100views Management» more  PC 2000»
13 years 8 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
13 years 6 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick