6142 search results - page 30 / 1229 » The Complexity of Partition Functions |
MASCOTS
2003
14 years 11 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
WG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
107
click to vote
AAAI
2010
14 years 11 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
EJC
2010
14 years 9 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
SCAI
1997
14 years 11 months ago
1997
The class of well-behaved evaluation functions simplifies and makes efficient the handling of numerical attributes; for them it suffices to concentrate on the boundary points in...