Sciweavers

1736 search results - page 123 / 348
» The rank-width of Directed Graphs
Sort
View
ICSM
1998
IEEE
15 years 8 months ago
Improving Visual Impact Analysis
Visual impact analysis is a software visualisation technique that lets software maintainers judge the impact of proposed changes and plan maintenance accordingly. An existing CASE...
Matthew A. Hutchins, Keith Gallagher
CONCUR
2006
Springer
15 years 8 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger
TOG
2008
100views more  TOG 2008»
15 years 4 months ago
Interactive procedural street modeling
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
Guoning Chen, Gregory Esch, Peter Wonka, Pascal M&...
142
Voted
JSSPP
2010
Springer
15 years 2 months ago
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
Yinglong Xia, Viktor K. Prasanna, James Li
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 8 months ago
Algorithms for Implicit Hitting Set Problems
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
Karthekeyan Chandrasekaran, Richard Karp, Erick Mo...