99 search results - page 13 / 20 » Dynamic Co-operative Intelligent Memory |
AAAI
2008
13 years 11 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
AI
1999
Springer
13 years 8 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
IEAAIE
1999
Springer
14 years 26 days ago
1999
Springer
This paper describes a new approach to model fuzzy sets using object-oriented programming techniques. Currently, the most frequently used method to model fuzzy sets is by using a p...
AAAI
1998
13 years 10 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
IDT
2010
13 years 7 months ago
2010
This paper examines the driving and opposing forces that are governing the current paradigm shift from a data-processing information technology environment without software intell...