58 search results - page 8 / 12 » Approximate Solution Techniques for Factored First-Order MDP... |
101
Voted
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
123
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
104
click to vote
CIBCB
2007
IEEE
15 years 6 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
107
click to vote
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
JCO
2011
14 years 7 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...