154 search results - page 21 / 31 » Anytime search in dynamic graphs |
PLDI
2010
ACM
14 years 6 months ago
2010
ACM
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
COMPSAC
2007
IEEE
14 years 2 months ago
2007
IEEE
Concept location is one of the fundamental activities during software maintenance which locates the parts of the source code where a specific concept is implemented. The methods f...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
GIS
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...