866 search results - page 148 / 174 » On Dynamic Shortest Paths Problems |
NSDI
2007
13 years 12 months ago
2007
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
ANOR
2007
13 years 9 months ago
2007
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
GECCO
2005
Springer
14 years 3 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
VLSID
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
QSIC
2003
IEEE
14 years 2 months ago
2003
IEEE
A character string is an important element in programming. A problem that needs further research is how to automatically generate software test data for character strings. This pa...