83 search results - page 11 / 17 » Finding the k Shortest Simple Paths: A New Algorithm and Its... |
ENTCS
2002
13 years 7 months ago
2002
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
GECCO
2003
Springer
14 years 24 days ago
2003
Springer
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
A new stochastic optimization algorithm referred to by the authors as the `Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category ...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead to the discovery of truly unexpected knowledge in ...