Sciweavers

5247 search results - page 46 / 1050
» The Generalized A* Architecture
Sort
View
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
13 years 9 months ago
A Fibonacci-like Sequence of Composite Numbers
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
John W. Nicol
CC
2010
Springer
117views System Software» more  CC 2010»
13 years 7 months ago
Efficiently Certifying Non-Integer Powers
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
Erich Kaltofen, Mark Lavin
ICML
2007
IEEE
14 years 10 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
IJCAI
1989
13 years 11 months ago
The Specialization and Transformation of Constructive Existence Proofs
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adaptin...
Peter Madden
CCE
2008
13 years 10 months ago
Stochastic-based accuracy of data reconciliation estimators for linear systems
Accuracy of an instrument has been traditionally defined as the sum of the precision and the bias. Recently, this notion was generalized to estimators [Bagajewicz, M. (2005a). On ...
Miguel J. Bagajewicz, DuyQuang Nguyen