Sciweavers

5473 search results - page 103 / 1095
» On the graph isomorphism problem
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
CIMCA
2005
IEEE
15 years 12 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
STRINGOLOGY
2008
15 years 7 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
16 years 1 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng
IWANN
2007
Springer
16 years 15 days ago
A Comparison Between ANN Generation and Training Methods and Their Development by Means of Graph Evolution: 2 Sample Problems
Abstract. This paper presents a study in which a new technique for automatically developing Artificial Neural Networks (ANNs) by means of Evolutionary Computation (EC) tools is com...
Daniel Rivero, Julian Dorado, Juan R. Rabuñ...