Sciweavers

3677 search results - page 47 / 736
» Generalized Adaptive A*
Sort
View
ACS
2004
15 years 6 months ago
A Categorical Approach to Threshold Agent Networks
Threshold agent networks (TANs) constitute a discretized modification of threshold (also known as neural) networks that are appropriate for modeling computer simulations. In this p...
George Voutsadakis
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
15 years 5 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»
15 years 3 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
16 years 7 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
CCE
2008
15 years 6 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