Sciweavers

354 search results - page 57 / 71
» Sorting networks on FPGAs
Sort
View
INFOCOM
1997
IEEE
14 years 2 months ago
A Near-Optimal Packet Scheduler for QoS Networks
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
Dallas E. Wrege, Jörg Liebeherr
ORL
1998
68views more  ORL 1998»
13 years 9 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
CN
2007
141views more  CN 2007»
13 years 9 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
MOBIWAC
2006
ACM
14 years 3 months ago
A totally decentralized document sharing system for mobile ad hoc networks
Many research projects have defined applications that are claimed to operate in a MANet environment. Consider for instance these software tools that make it possible to share inf...
Lionel Barrère, Arnaud Casteigts, Serge Cha...