Sciweavers

3352 search results - page 105 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
CVPR
2007
IEEE
16 years 7 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
15 years 11 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers
IJCAI
2003
15 years 6 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
COR
2006
88views more  COR 2006»
15 years 5 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
NETWORKS
2007
15 years 4 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...