3678 search results - page 27 / 736 » On the Stable Paths Problem |
165
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
153
click to vote
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
159
click to vote
LPNMR
2001
Springer
15 years 10 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
152
click to vote
AI
2004
Springer
15 years 5 months ago
2004
Springer
This paper deals with the problem of designing a strategy profile which will enable collaborative interaction between agents. In particular, we consider the problem of information...
149
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in P...