654 search results - page 63 / 131 » Ordered Sets and Complete Lattices |
CP
2006
Springer
13 years 11 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...
EURONGI
2006
Springer
13 years 11 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...
AAAI
2008
13 years 10 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...
DATAMINE
2006
13 years 7 months ago
2006
Effective information systems require the existence of explicit process models. A completely specified process design needs to be developed in order to enact a given business proce...
ICDE
2004
IEEE
14 years 9 months ago
2004
IEEE
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...