172 search results - page 32 / 35 » Program generation for the all-pairs shortest path problem |
CP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
WISEC
2010
ACM
14 years 2 months ago
2010
ACM
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
HPDC
2005
IEEE
14 years 1 months ago
2005
IEEE
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
IDMS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
WG
1998
Springer
13 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...