11160 search results - page 79 / 2232 » Incompleteness in a General Setting |
90
Voted
ALT
2010
Springer
15 years 2 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
97
Voted
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
CG
2007
Springer
15 years 21 days ago
2007
Springer
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and mu...
99
Voted
RAM
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
98
Voted
ISCIS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...