100 search results - page 12 / 20 » sat 2005 |
157
click to vote
AMAI
2005
Springer
15 years 5 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
160
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
154
click to vote
RSFDGRC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
153
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
163
click to vote
CAEPIA
2005
Springer
15 years 11 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...