1983 search results - page 255 / 397 » Competitive graph searches |
JMLR
2006
13 years 8 months ago
2006
We describe anytime search procedures that (1) find disjoint subsets of recorded variables for which the members of each subset are d-separated by a single common unrecorded cause...
KES
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, in order to reduce the explosive increase of the search space as the input dimension grows, we present a new representation method for the structure of fuzzy rules, ...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
TWC
2008
13 years 6 months ago
2008
In this letter, we propose a generalized version of the window-based pseudonoise (PN) acquisition scheme verifying one or more best hypotheses rather than the best one per search w...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...