790 search results - page 106 / 158 » Subexponential Parameterized Algorithms |
128
Voted
DAC
1994
ACM
15 years 6 months ago
1994
ACM
We present a systematic approach to synthesize an instruction set such that the given application software can be efficiently mapped to a parameterized, pipelined microarchitectur...
147
Voted
HUMO
2007
Springer
15 years 6 months ago
2007
Springer
We propose a method to find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness functi...
121
Voted
ANTSW
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
109
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...
119
Voted
AIPS
2008
15 years 5 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...