Sciweavers

1941 search results - page 312 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
COCOA
2010
Springer
15 years 4 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
ICUIMC
2009
ACM
16 years 26 days ago
Proposal and evaluation of multiple gateways distribution method for wireless mesh network
Researches on the wireless mesh network in which access points (APs) of a wireless LAN are connected by an ad-hoc networks are recently drawing much attention. In the wireless mes...
Masashi Ito, Toshihiro Shikama, Akira Watanabe
ANCS
2005
ACM
15 years 12 months ago
Framework for supporting multi-service edge packet processing on network processors
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
Arun Raghunath, Aaron R. Kunze, Erik J. Johnson, V...
ICALP
2003
Springer
15 years 11 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
DAC
2002
ACM
16 years 7 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...