1254 search results - page 92 / 251 » Making Hard Problems Harder |
SPLC
2008
13 years 10 months ago
2008
Feature models are widely used to model software product-line (SPL) variability. SPL variants are configured by selecting feature sets that satisfy feature model constraints. Conf...
AAAI
2006
13 years 10 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
AAAI
2006
13 years 10 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
ECSCW
2001
13 years 10 months ago
2001
This paper seeks to inform the ongoing redesign of air traffic management by examining current practices and the adoption of a new system aiming to relieve traffic control from wor...
IJCAI
1997
13 years 10 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...