925 search results - page 107 / 185 » Connectivity on Complete Lattices |
166
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
133
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
148
click to vote
NSPW
2004
ACM
15 years 11 months ago
2004
ACM
Current models of Internet Computing are highly asymmetric – a host protects itself from malicious mobile Java programs, but there is no way to get assurances about the behavior...
120
click to vote
EUC
2004
Springer
15 years 11 months ago
2004
Springer
Communication optimization plays an important role in building networked distributed applications. In this paper, we systematically evaluate four bandwidth reduction algorithms, n...
160
click to vote
GRID
2004
Springer
15 years 11 months ago
2004
Springer
The problem with the Grid is that it does not currently extend completely to devices, because these devices are not viewed as having sufficient capability to be both clients and s...