299 search results - page 11 / 60 » Dispositional implementation solves the superfluous structur... |
TON
2002
13 years 8 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...
JSAT
2006
13 years 8 months ago
2006
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
ECAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
BMCBI
2005
13 years 8 months ago
2005
Background: Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflo...