3758 search results - page 208 / 752 » A Complete Subsumption Algorithm |
135
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
135
Voted
DAWAK
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
117
Voted
DLOG
2008
15 years 4 months ago
2008
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
102
click to vote
AUSAI
2008
Springer
15 years 4 months ago
2008
Springer
Learning Classifier System (LCS) is an effective tool to solve classification problems. Clustering with XCS (accuracy-based LCS) is a novel approach proposed recently. In this pape...
125
click to vote
IJCAI
2003
15 years 3 months ago
2003
Traditional single-agent search algorithms usually make simplifying assumptions (single search agent, stationary target, complete knowledge of the state, and sufficient time). The...