3678 search results - page 27 / 736 » On the Stable Paths Problem |
133
Voted
ASPDAC
2007
ACM
15 years 7 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...
119
Voted
PKDD
2010
Springer
15 years 1 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...
131
Voted
LPNMR
2001
Springer
15 years 8 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...
109
Voted
AI
2004
Springer
15 years 3 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...
125
Voted
CORR
2010
Springer
15 years 26 days 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...