4066 search results - page 331 / 814 » Almost Complete Sets |
176
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
183
click to vote
EURONGI
2006
Springer
15 years 10 months ago
2006
Springer
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic...
169
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
The present paper describes a case-based reasoning solution for solving the task of selecting adequate templates for realizing messages describing actions in a given domain. This s...
207
click to vote
AAAI
2008
15 years 9 months ago
2008
We describe HTN-MAKER, an algorithm for learning hierarchical planning knowledge in the form of decomposition methods for Hierarchical Task Networks (HTNs). HTNMAKER takes as inpu...
187
click to vote
CIBB
2008
15 years 8 months ago
2008
A system for utilizing an artificial neural network to predict splice sites in genes has been studied. The neural network uses a sliding window of nucleotides over a gene and predi...