Sciweavers

250 search results - page 44 / 50
» A Parallel Iterative Improvement Stable Matching Algorithm
Sort
View
GCC
2003
Springer
15 years 2 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
109
Voted
DAC
2007
ACM
15 years 10 months ago
Program Mapping onto Network Processors by Recursive Bipartitioning and Refining
Mapping packet processing applications onto embedded network processors (NP) is a challenging task due to the unique constraints of NP systems and the characteristics of network a...
Jia Yu, Jingnan Yao, Jun Yang 0002, Laxmi N. Bhuya...
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
15 years 2 months ago
HORUS - high-dimensional Model Order Reduction via low moment-matching upgraded sampling
— This paper describes a Model Order Reduction algorithm for multi-dimensional parameterized systems, based on a sampling procedure which incorporates a low order moment matching...
Jorge Fernandez Villena, Luis Miguel Silveira
75
Voted
CORR
2008
Springer
141views Education» more  CORR 2008»
14 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
15 years 10 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...