2108 search results - page 229 / 422 » Constrained Heuristic Search |
179
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Achieving peak performance from library subroutines usually requires extensive, machine-dependent tuning by hand. Automatic tuning systems have emerged in response, and they typic...
197
click to vote
FLAIRS
2004
15 years 7 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
150
click to vote
UAI
2001
15 years 7 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
162
click to vote
AAAI
1990
15 years 7 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
164
click to vote
SIGGRAPH
1995
ACM
15 years 10 months ago
1995
ACM
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...