Sciweavers

6045 search results - page 342 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
JVCA
2007
128views more  JVCA 2007»
15 years 7 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
ICTAI
2009
IEEE
16 years 2 months ago
Evolution Strategies for Constants Optimization in Genetic Programming
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
César Luis Alonso, José Luis Monta&n...
182
Voted
PG
2007
IEEE
16 years 1 months ago
A Subdivision Arrangement Algorithm for Semi-Algebraic Curves: An Overview
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
Julien Wintz, Bernard Mourrain
PARA
2004
Springer
16 years 26 days ago
Performance of Taylor Model Methods for Validated Integration of ODEs
The performance of various Taylor model (TM)-based methods for the validated integration of ODEs is studied for some representative computational problems. For nonlinear problems, ...
Martin Berz, Kyoko Makino
230
Voted
AAAI
2004
15 years 9 months ago
Distributed Representation of Syntactic Structure by Tensor Product Representation and Non-Linear Compression
Representing lexicons and sentences with the subsymbolic approach (using techniques such as Self Organizing Map (SOM) or Artificial Neural Network (ANN)) is a relatively new but i...
Heidi H. T. Yeung, Peter W. M. Tsang