1404 search results - page 134 / 281 » Optimization problems in multiple-interval graphs |
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
109
click to vote
ALT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
UAI
2008
14 years 11 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...