1568 search results - page 21 / 314 » The problem of examination questions in algorithmics |
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a sc...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....