Sciweavers

1101 search results - page 130 / 221
» heuristics 2007
Sort
View
ICMLA
2007
13 years 11 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
IJCAI
2007
13 years 11 months ago
Building Structure into Local Search for SAT
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
Duc Nghia Pham, John Thornton, Abdul Sattar
LWA
2007
13 years 11 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
MASCOTS
2007
13 years 11 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
MASCOTS
2007
13 years 11 months ago
Performance Analysis of Wireless MAC Protocols Using a Search Based Framework
—Previously, we have developed a framework to perform systematic analysis of CSMA/CA based wireless MAC protocols. The framework first identifies protocol states that meet our ...
Shamim Begum, Sandeep K. S. Gupta, Ahmed Helmy