235 search results - page 19 / 47 » Average-case complexity and decision problems in group theor... |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
MISQ
2002
13 years 9 months ago
2002
This paper addresses the design problem of providing IT support for emerging knowledge processes (EKPs). EKPs are organizational activity patterns that exhibit three characteristi...
ANNPR
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Hierarchical neural networks show many benefits when employed for classification problems even when only simple methods analogous to decision trees are used to retrieve t...