Sciweavers

8699 search results - page 30 / 1740
» Elements of the Theory of Computation
Sort
View
MOC
1998
106views more  MOC 1998»
13 years 7 months ago
Bounds for eigenvalues and condition numbers in the p-version of the finite element method
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
Ning Hu, Xian-Zhong Guo, I. Norman Katz
SEMWEB
2009
Springer
14 years 2 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
CCA
2009
Springer
14 years 2 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 27 days ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
VSTTE
2012
Springer
12 years 3 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak