Sciweavers

1026 search results - page 139 / 206
» On Finding Minimal w-cutset
Sort
View
BROADNETS
2006
IEEE
14 years 25 days ago
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
Abstract-- Optical Networks with wavelength routing are expected to form the backbone in the next generation wide area networks. The traffic grooming problem in optical networks is...
Shu Huang, Rudra Dutta
CMSB
2006
Springer
14 years 25 days ago
Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
FPL
2004
Springer
115views Hardware» more  FPL 2004»
14 years 25 days ago
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
Ali Ahmadinia, Christophe Bobda, Sándor P. ...
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
14 years 23 days ago
Exploring network topology evolution through evolutionary computations
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
Sami J. Habib, Alice C. Parker
ASYNC
1997
IEEE
103views Hardware» more  ASYNC 1997»
14 years 20 days ago
Efficient Timing Analysis Algorithms for Timed State Space Exploration
This paper presents new timing analysis algorithms for efficient state space exploration during timed circuit synthesis. Timed circuits are a class of asynchronous circuits that i...
Wendy Belluomini, Chris J. Myers