6110 search results - page 179 / 1222 » Approximate Computing |
205
click to vote
WAOA
2007
Springer
16 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
176
Voted
TACAS
2010
Springer
16 years 9 days ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
189
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper presents a novel swarm approximate dynamic programming method (swarm-ADP) for parameter optimization of PSO systems, from the perspective of optimal control. Based o...
185
click to vote
CCCG
2007
15 years 8 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
156
click to vote
CMA
2010
15 years 4 months ago
2010
In this paper, the homotopy analysis method (HAM) is applied to solve a parameterized sixth order boundary value problem which, for large parameter values, cannot be solved by oth...