1615 search results - page 139 / 323 » Computer science and decision theory |
106
click to vote
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
113
click to vote
FCT
1999
Springer
15 years 5 months ago
1999
Springer
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
85
Voted
WICON
2008
15 years 2 months ago
2008
Much previous work has examined the wireless power control problem using tools from game theory, an economic concept which describes the behavior of interdependent but non-coopera...
TCS
2002
15 years 10 days ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
108
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...