Sciweavers

3328 search results - page 201 / 666
» On Plateaued Functions and Their Constructions
Sort
View
NIPS
1993
15 years 8 months ago
Structural and Behavioral Evolution of Recurrent Networks
This paper introduces GNARL, an evolutionary program which induces recurrent neural networks that are structurally unconstrained. In contrast to constructive and destructive algor...
Gregory M. Saunders, Peter J. Angeline, Jordan B. ...
AIPS
2009
15 years 7 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
ANOR
2010
89views more  ANOR 2010»
15 years 6 months ago
Convex approximations for a class of mixed-integer recourse models
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recour...
Maarten H. van der Vlerk
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 6 months ago
Efficient Computation of Optimal Trading Strategies
Given the return series for a set of instruments, a trading strategy is a switching function that transfers wealth from one instrument to another at specified times. We present ef...
Victor Boyarshinov, Malik Magdon-Ismail
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 6 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek