Sciweavers

736 search results - page 80 / 148
» Approximating the Number of Network Motifs
Sort
View
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
15 years 3 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ICTCS
2003
Springer
15 years 3 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
COR
2007
108views more  COR 2007»
14 years 10 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
14 years 8 months ago
Maintaining connectivity in environments with obstacles
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
Onur Tekdas, Patrick A. Plonski, Nikhil Karnad, Vo...
PE
2010
Springer
124views Optimization» more  PE 2010»
14 years 4 months ago
High-level approach to modeling of observed system behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of cap...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...