Sciweavers

1502 search results - page 176 / 301
» Node weighted scheduling
Sort
View
IJFCS
2006
82views more  IJFCS 2006»
15 years 3 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
141
Voted
SIGCOMM
2010
ACM
15 years 1 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
123
Voted
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 24 days ago
Performance Analysis of QoS in PMP Mode WiMax Networks
IEEE 802.16 standard supports two different topologies: point to multipoint (PMP) and Mesh. In this paper, a QoS mechanism for point to multipoint of IEEE 802.16 and BS scheduler ...
Maninder Singh Kamboj, Harwinder Singh
135
Voted
COCOA
2008
Springer
15 years 5 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke
146
Voted
ACL
2006
15 years 4 months ago
Relation Extraction Using Label Propagation Based Semi-Supervised Learning
Shortage of manually labeled data is an obstacle to supervised relation extraction methods. In this paper we investigate a graph based semi-supervised learning algorithm, a label ...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...