Sciweavers

402 search results - page 63 / 81
» A branch and cut algorithm for the Steiner problem in graphs
Sort
View
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 17 days ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
CC
2003
Springer
114views System Software» more  CC 2003»
14 years 17 days ago
Combined Code Motion and Register Allocation Using the Value State Dependence Graph
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
Neil Johnson, Alan Mycroft
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 4 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
TACAS
2004
Springer
127views Algorithms» more  TACAS 2004»
14 years 20 days ago
MetaGame: An Animation Tool for Model-Checking Games
Abstract. Failing model checking runs should be accompanied by appropriate error diagnosis information that allows the user to identify the cause of the problem. For branching time...
Markus Müller-Olm, Haiseung Yoo
WWW
2009
ACM
14 years 8 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore