Sciweavers

6045 search results - page 24 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 2 months ago
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
Frank E. Curtis, Olaf Schenk, Andreas Wächter
ICANN
2007
Springer
14 years 1 months ago
Event Detection and Localization in Mobile Robot Navigation Using Reservoir Computing
Abstract. Reservoir Computing (RC) uses a randomly created recurrent neural network where only a linear readout layer is trained. In this work, RC is used for detecting complex eve...
Eric A. Antonelo, Benjamin Schrauwen, Xavier Dutoi...
COMPGEOM
2000
ACM
14 years 3 days ago
Pitfalls in computing with pseudorandom determinants
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
Bernd Gärtner
SIAMJO
2000
116views more  SIAMJO 2000»
13 years 7 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
ECCV
1996
Springer
14 years 9 months ago
Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
Peter N. Belhumeur, João P. Hespanha, David...