Sciweavers

1521 search results - page 100 / 305
» Efficient Design Validation Based on Cultural Algorithms
Sort
View
COCOON
2006
Springer
15 years 1 months ago
A Detachment Algorithm for Inferring a Graph from Path Frequency
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
Hiroshi Nagamochi
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 4 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
IEEEPACT
2009
IEEE
14 years 7 months ago
Algorithmic Skeletons within an Embedded Domain Specific Language for the CELL Processor
Efficiently using the hardware capabilities of the Cell processor, a heterogeneous chip multiprocessor that uses several levels of parallelism to deliver high performance, and bei...
Tarik Saidani, Joel Falcou, Claude Tadonki, Lionel...
INFOCOM
2005
IEEE
15 years 3 months ago
TCAM-based distributed parallel packet classification algorithm with range-matching solution
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
Kai Zheng, Hao Che, Zhijun Wang, Bin Liu
MP
2006
88views more  MP 2006»
14 years 9 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...