134 search results - page 2 / 27 » An Optimal Rebuilding Strategy for an Incremental Tree Probl... |
IIE
2007
13 years 4 months ago
2007
AI
2006
Springer
13 years 4 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
FLAIRS
2008
13 years 7 months ago
2008
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
UM
2001
Springer
13 years 9 months ago
2001
Springer
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
AAAI
2012
11 years 7 months ago
2012
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...