1892 search results - page 242 / 379 » Warren's Abstract Machine |
83
Voted
APPROX
2008
Springer
15 years 4 days ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
CIBB
2008
15 years 3 days ago
2008
Abstract. We evaluated methods of protein classification that use kernels built from BLAST output parameters. Protein sequences were represented as vectors of parameters (e.g. simi...
ECAI
2006
Springer
15 years 2 days ago
2006
Springer
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
COCOA
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
CSL
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...