3678 search results - page 21 / 736 » On the Stable Paths Problem |
CIE
2007
Springer
14 years 4 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
ACID
2006
13 years 11 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
ICTAI
1999
IEEE
14 years 2 months ago
1999
IEEE
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
AMC
2006
13 years 10 months ago
2006
We develop numerical methods for solving nonlinear equations of conservation laws with flux function that depends on discontinuous coefficients. Using a relaxation approximation, ...