Sciweavers

485 search results - page 36 / 97
» Iterative Bounding LAO
Sort
View
CEC
2010
IEEE
15 years 5 months ago
Generating a novel sort algorithm using Reinforcement Programming
Abstract-- Reinforcement Programming (RP) is a new approach to automatically generating algorithms, that uses reinforcement learning techniques. This paper describes the RP approac...
Spencer K. White, Tony R. Martinez, George L. Rudo...
CORR
2010
Springer
76views Education» more  CORR 2010»
14 years 11 months ago
Power Control with Imperfect Exchanges and Applications to Spectrum Sharing
In various applications, the effect of errors in gradient-based iterations is of particular importance when seeking saddle points of the Lagrangian function associated with constra...
Nikolaos Gatsis, Georgios B. Giannakis
JSYML
2011
68views more  JSYML 2011»
14 years 7 months ago
Ramsey-like cardinals
This paper continues the study of the Ramsey-like large cardinals introduced in [Git09] and [WS08]. Ramsey-like cardinals are defined by generalizing the “existence of elementar...
Victoria Gitman
IDA
1997
Springer
15 years 8 months ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
VLSID
2010
IEEE
155views VLSI» more  VLSID 2010»
15 years 2 months ago
Synchronized Generation of Directed Tests Using Satisfiability Solving
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
Xiaoke Qin, Mingsong Chen, Prabhat Mishra