840 search results - page 150 / 168 » Inapproximability of Combinatorial Optimization Problems |
PRIB
2009
Springer
14 years 4 months ago
2009
Springer
For many biomedical modelling tasks a number of different types of data may influence predictions made by the model. An established approach to pursuing supervised learning with ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Stochastic Local Search (SLS) is a simple and effective paradigm for attacking a variety of Combinatorial (Optimization) Problems (COP). However, it is often non-trivial...
WABI
2004
Springer
14 years 3 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
IAT
2003
IEEE
14 years 3 months ago
2003
IEEE
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
SAGA
2001
Springer
14 years 2 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...