Sciweavers

7129 search results - page 736 / 1426
» Approximation Algorithms for Treewidth
Sort
View
HEURISTICS
2006
197views more  HEURISTICS 2006»
15 years 7 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
IANDC
2006
86views more  IANDC 2006»
15 years 7 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
JSAC
2006
79views more  JSAC 2006»
15 years 7 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
JAIR
2007
112views more  JAIR 2007»
15 years 7 months ago
Cutset Sampling for Bayesian Networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
Bozhena Bidyuk, Rina Dechter
CORR
2002
Springer
79views Education» more  CORR 2002»
15 years 6 months ago
Technical Note: Bias and the Quantification of Stability
Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should al...
Peter D. Turney