Sciweavers

405 search results - page 41 / 81
» Approximation properties of the Generalized Finite Element M...
Sort
View
NIPS
2007
13 years 9 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
FOCS
2009
IEEE
14 years 2 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
CJ
2004
105views more  CJ 2004»
13 years 7 months ago
Generalized Template Splay: A Basic Theory and Calculus
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
George F. Georgakopoulos, David J. McClurkin
MOC
2000
109views more  MOC 2000»
13 years 7 months ago
A posteriori error estimation and adaptivity for degenerate parabolic problems
Abstract. Two explicit error representation formulas are derived for degenerate parabolic PDEs, which are based on evaluating a parabolic residual in negative norms. The resulting ...
Ricardo H. Nochetto, Alfred Schmidt, C. Verdi