9842 search results - page 1406 / 1969 » Problem complexity |
182
click to vote
ALMOB
2006
15 years 7 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
219
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Signi cant eort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing e cient mobile multicast man...
201
click to vote
AI
2000
Springer
15 years 7 months ago
2000
Springer
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
203
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
206
click to vote
NPL
2002
15 years 6 months ago
2002
A neural network model of associative memory is presented which unifies the two historically more relevant enhancements to the basic Little-Hopfield discrete model: the graded resp...