Sciweavers

1404 search results - page 12 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 1 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
VLSISP
2002
112views more  VLSISP 2002»
13 years 9 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai
GBRPR
2009
Springer
13 years 7 months ago
Electric Field Theory Motivated Graph Construction for Optimal Medical Image Segmentation
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
Yin Yin, Qi Song, Milan Sonka
NOMS
2010
IEEE
195views Communications» more  NOMS 2010»
13 years 7 months ago
Optimized network configuration parameter assignment based on graph coloring
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
Tobias Bandh, Georg Carle, Henning Sanneck, Lars-C...
JCO
1998
136views more  JCO 1998»
13 years 9 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...