Sciweavers

3250 search results - page 283 / 650
» An Algorithm to Solve a Linear Program
Sort
View
FLAIRS
2004
15 years 8 months ago
Iterative Improvement of Neural Classifiers
A new objective function for neural net classifier design is presented, which has more free parameters than the classical objective function. An iterative minimization technique f...
Jiang Li, Michael T. Manry, Li-min Liu, Changhua Y...
CORR
2011
Springer
162views Education» more  CORR 2011»
15 years 1 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen
COLT
2007
Springer
15 years 10 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
ATAL
2008
Springer
15 years 8 months ago
Non-linear dynamics in multiagent reinforcement learning algorithms
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Only a subset of these MARL algorithms both do not require agent...
Sherief Abdallah, Victor R. Lesser
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 8 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking