15777 search results - page 2618 / 3156 » Software Engineering |
189
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ļ¬...
301
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...
232
click to vote
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...
200
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
Researchers maintain bibliographies and extensive sets of PDF ļ¬les of scholarly publications on their desktop. The lack of proper metadata of downloaded PDFs makes this task a t...
176
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...