Sciweavers

20638 search results - page 3940 / 4128
» Computer Networks
Sort
View
JCO
2010
182views more  JCO 2010»
15 years 23 days ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
JOT
2010
108views more  JOT 2010»
15 years 23 days ago
Dynamic adaptability with .NET service components
In self-adaptive systems components are dynamically modified according to the execution environment requirement, where each component is a probable point of failure. Existing appr...
Arun Mishra, A. K. Misra
119
Voted
JUCS
2010
150views more  JUCS 2010»
15 years 23 days ago
SOM Clustering to Promote Interoperability of Directory Metadata: A Grid-Enabled Genetic Algorithm Approach
: Directories provide a general mechanism for describing resources and enabling information sharing within and across organizations. Directories must resolve differing structures a...
Lei Li, Vijay K. Vaishnavi, Art Vandenberg
LATIN
2010
Springer
15 years 23 days ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
TMC
2010
109views more  TMC 2010»
15 years 21 days ago
Uncertainty Modeling and Reduction in MANETs
—Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right or wrong...
Feng Li, Jie Wu
« Prev « First page 3940 / 4128 Last » Next »