Sciweavers

116 search results - page 13 / 24
» Special Issue on Foundations of Computer Science
Sort
View
JC
2007
160views more  JC 2007»
13 years 7 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
AAAI
1992
13 years 8 months ago
Analyzing Failure Recovery to Improve Planner Design
Plans fail for many reasons. During planner development, failure can often be traced to actions of the planner itself. Failure recovery analysis is a procedure for analyzing execu...
Adele E. Howe
VLDB
1998
ACM
101views Database» more  VLDB 1998»
13 years 12 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
TCS
2011
13 years 2 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon
KI
2010
Springer
13 years 6 months ago
Spatial Cognition: Reasoning, Action, Interaction
ut spatial environments, be it real or abstract, human or machine. Research issues range from human spatial cognition to mobile robot navigation. Numerous results have been obtaine...
Christian Freksa, Holger Schultheis, Kerstin Schil...