Sciweavers

17366 search results - page 146 / 3474
» New Revision Algorithms
Sort
View
AI
2005
Springer
15 years 4 months ago
Asynchronous backtracking without adding links: a new member in the ABT family
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
Christian Bessière, Arnold Maestre, Ismel B...
LATIN
2010
Springer
15 years 11 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
PPSN
2000
Springer
15 years 7 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English
MICS
2007
100views more  MICS 2007»
15 years 3 months ago
A New Method for Real Root Isolation of Univariate Polynomials
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arit...
Ting Zhang, Bican Xia
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 9 months ago
Breeding swarms: a new approach to recurrent neural network training
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
Matthew Settles, Paul Nathan, Terence Soule