664 search results - page 25 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
100
click to vote
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
HM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
GLVLSI
2010
IEEE
14 years 10 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
EVOW
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...