13376 search results - page 476 / 2676 » Problem Solving with |
136
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
147
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
ion and Refinement Hyunyoung Kil Wonhong Nam Dongwon Lee The Pennsylvania State University, University Park, PA 16802, USA {hykil, wnam, dongwon}@psu.edu The behavioral descriptio...
173
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
165
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...
160
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...