429 search results - page 31 / 86 » Solving the Maximum Clique Problem Using PUBB |
UAI
1990
13 years 8 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
CPAIOR
2010
Springer
14 years 15 days ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
CCCG
2008
13 years 9 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
ENTCS
2007
13 years 7 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...