Sciweavers

165 search results - page 24 / 33
» Graph Partitioning Based on Link Distributions
Sort
View
IEEEPACT
2002
IEEE
14 years 12 days ago
A Framework for Parallelizing Load/Stores on Embedded Processors
Many modern embedded processors (esp. DSPs) support partitioned memory banks (also called X-Y memory or dual bank memory) along with parallel load/store instructions to achieve co...
Xiaotong Zhuang, Santosh Pande, John S. Greenland ...
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
14 years 12 days ago
A Set Theory Based Approach on Applying Domain Semantics to XML Structures
As XML is gathering more and more importance in the field of data interchange in distributed business to business (B2B) applications, it is increasingly important to provide a for...
Wolfgang Schuetzelhofer, Karl M. Göschka
INFOCOM
2005
IEEE
14 years 1 months ago
Joint congestion control and media access control design for ad hoc wireless networks
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...
Lijun Chen, Steven H. Low, John C. Doyle
JEI
2007
144views more  JEI 2007»
13 years 7 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
PPSN
2000
Springer
13 years 11 months ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica