Sciweavers

1022 search results - page 77 / 205
» New models and algorithms for programmable networks
Sort
View
109
Voted
TCAD
2002
73views more  TCAD 2002»
15 years 12 days ago
A timing-constrained simultaneous global routing algorithm
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
Jiang Hu, Sachin S. Sapatnekar
IOR
2007
119views more  IOR 2007»
15 years 20 days ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha
117
Voted
CIBCB
2007
IEEE
15 years 2 months ago
Optimization of Bacterial Strains with Variable-Sized Evolutionary Algorithms
—In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the co...
Miguel Rocha, José P. Pinto, Isabel Rocha, ...
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
15 years 7 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
VISUALIZATION
1995
IEEE
15 years 4 months ago
Automatic Generation of Triangular Irregular Networks Using Greedy Cuts
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...