4036 search results - page 511 / 808 » Formal Methods |
181
click to vote
SIAMCO
2011
14 years 9 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di�...
286
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
223
Voted
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
274
click to vote
CAV
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. BioModel Analyzer (bma) is a tool for modeling and analyzing biological networks. Designed with a lightweight graphical user interface, the tool facilitates usage for bio...
160
Voted
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professiona...