2869 search results - page 167 / 574 » The Inference Problem: A Survey |
139
click to vote
DFG
1992
Springer
15 years 4 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
114
click to vote
FMCO
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
110
Voted
FOSAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. There is great interest in applying nominal calculi--computational formalisms that include dynamic name generation--to the problems of programming, specifying, and verify...
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
89
Voted
CSREAEEE
2006
15 years 2 months ago
2006
The mainframe workforce is dwindling as the baby boomers look to retire. The problem is we do not have enough mainframe-educated people to replace the retirees. A survey to busine...