Sciweavers

892 search results - page 107 / 179
» et 2007
Sort
View
IJCAI
2007
13 years 10 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
IJCAI
2007
13 years 10 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
IJCAI
2007
13 years 10 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
IJCAI
2007
13 years 10 months ago
Ensembles of Partially Trained SVMs with Multiplicative Updates
The training of support vector machines (SVM) involves a quadratic programming problem, which is often optimized by a complicated numerical solver. In this paper, we propose a muc...
Ivor W. Tsang, James T. Kwok
NETWORKING
2007
13 years 10 months ago
Improving XCP to Achieve Max-Min Fair Bandwidth Allocation
TCP is shown to be inefficient and instable in high speed and long latency networks. The eXplicit Control Protocol (XCP) is a new and promising protocol that outperforms TCP in ter...
Lei Zan, Xiaowei Yang