3678 search results - page 404 / 736 » On the Stable Paths Problem |
208
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
214
Voted
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
170
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
194
click to vote
ASWEC
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...
168
click to vote
CN
2010
15 years 6 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...