293 search results - page 15 / 59 » Geometric algorithms for clearance based optimal path comput... |
132
Voted
ICNP
2002
IEEE
15 years 4 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
89
Voted
COMPGEOM
1997
ACM
15 years 3 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
101
Voted
ICCSA
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
90
Voted
EDCC
2008
Springer
15 years 1 months ago
2008
Springer
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...
130
Voted
ICDCS
1997
IEEE
15 years 3 months ago
1997
IEEE
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of ...