Sciweavers

1447 search results - page 163 / 290
» Graphs and Path Equilibria
Sort
View
125
Voted
WER
2007
Springer
15 years 10 months ago
Towards Variability Design as Decision Boundary Placement
Complex information systems have numerous design variables that are systematically decided upon during the design process. In high-variability systems, some of these decisions are...
Catalin Bidian, Eric S. K. Yu
IPPS
2006
IEEE
15 years 10 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
15 years 8 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
160
Voted
DILS
2006
Springer
15 years 8 months ago
On Querying OBO Ontologies Using a DAG Pattern Query Language
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
Amarnath Gupta, Simone Santini
GD
2006
Springer
15 years 8 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow