Sciweavers

8540 search results - page 251 / 1708
» The Dynamic Servers Problem
Sort
View
140
Voted
ACSC
2008
IEEE
15 years 5 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish
138
Voted
IJCAI
1993
15 years 4 months ago
Perception and Experience in Problem Solving
Whilst much emphasis in AI has been placed on the use of goals in problem solving, less emphasis has been placed on the role of perception and experience. In this paper we show th...
Edmund Furse, Rod Nicolson
125
Voted
EOR
2008
93views more  EOR 2008»
15 years 3 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
124
Voted
EOR
2007
117views more  EOR 2007»
15 years 3 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
138
Voted
CCE
2004
15 years 3 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff