Sciweavers

3128 search results - page 272 / 626
» Finite element method
Sort
View
COMBINATORICS
2004
48views more  COMBINATORICS 2004»
15 years 4 months ago
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
Jason P. Bell, Stanley Burris
MOC
2000
111views more  MOC 2000»
15 years 4 months ago
Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
Renate Scheidler, Andreas Stein
JSC
2002
61views more  JSC 2002»
15 years 4 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
15 years 2 months ago
Human-in-the-Loop: Terminal constraint receding horizon control with human inputs
Abstract-- This paper presents a control theoretic formulation and optimal control solution for integrating human control inputs subject to linear state constraints. The formulatio...
Rahul Chipalkatty, Magnus Egerstedt
ESSLLI
2009
Springer
15 years 2 months ago
POP* and Semantic Labeling Using SAT
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
Martin Avanzini