Sciweavers

3678 search results - page 27 / 736
» On the Stable Paths Problem
Sort
View
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
14 years 1 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- 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...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 7 months ago
Efficient and Numerically Stable Sparse Learning
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...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
LPNMR
2001
Springer
14 years 2 months ago
Bounded LTL Model Checking with Stable Models
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...
Keijo Heljanko, Ilkka Niemelä
AI
2004
Springer
13 years 9 months ago
Stable repeated strategies for information exchange between two autonomous agents
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...
Rina Azoulay-Schwartz, Sarit Kraus
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 7 months ago
Stable comparison of multidimensional persistent homology groups with torsion
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...
Patrizio Frosini