A remark on adaptive scheduling of optimization algorithms

Krisztián Balázs, L. Kóczy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper the scheduling problem of optimization algorithms is defined. This problem is about scheduling numerical optimization methods from a set of iterative 'oracle-based' techniques in order to obtain an as efficient as possible optimization process based on the given set of algorithms. Statements are formulated and proven about the scheduling problem and methods are proposed to solve this problem. The applicability of one of the proposed methods is demonstrated through a simple fuzzy rule based machine learning example.

Original languageEnglish
Title of host publicationCommunications in Computer and Information Science
Pages719-728
Number of pages10
Volume81 PART 2
DOIs
Publication statusPublished - 2010
Event13th International Conference on Information Processing and Management of Uncertainty, IPMU 2010 - Dortmund, Germany
Duration: Jun 28 2010Jul 2 2010

Publication series

NameCommunications in Computer and Information Science
Volume81 PART 2
ISSN (Print)18650929

Other

Other13th International Conference on Information Processing and Management of Uncertainty, IPMU 2010
CountryGermany
CityDortmund
Period6/28/107/2/10

Fingerprint

Scheduling
Fuzzy rules
Learning systems

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Balázs, K., & Kóczy, L. (2010). A remark on adaptive scheduling of optimization algorithms. In Communications in Computer and Information Science (Vol. 81 PART 2, pp. 719-728). (Communications in Computer and Information Science; Vol. 81 PART 2). https://doi.org/10.1007/978-3-642-14058-7_74

A remark on adaptive scheduling of optimization algorithms. / Balázs, Krisztián; Kóczy, L.

Communications in Computer and Information Science. Vol. 81 PART 2 2010. p. 719-728 (Communications in Computer and Information Science; Vol. 81 PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Balázs, K & Kóczy, L 2010, A remark on adaptive scheduling of optimization algorithms. in Communications in Computer and Information Science. vol. 81 PART 2, Communications in Computer and Information Science, vol. 81 PART 2, pp. 719-728, 13th International Conference on Information Processing and Management of Uncertainty, IPMU 2010, Dortmund, Germany, 6/28/10. https://doi.org/10.1007/978-3-642-14058-7_74
Balázs K, Kóczy L. A remark on adaptive scheduling of optimization algorithms. In Communications in Computer and Information Science. Vol. 81 PART 2. 2010. p. 719-728. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-14058-7_74
Balázs, Krisztián ; Kóczy, L. / A remark on adaptive scheduling of optimization algorithms. Communications in Computer and Information Science. Vol. 81 PART 2 2010. pp. 719-728 (Communications in Computer and Information Science).
@inproceedings{5a4baa9751cc41c6824456a2d4c41639,
title = "A remark on adaptive scheduling of optimization algorithms",
abstract = "In this paper the scheduling problem of optimization algorithms is defined. This problem is about scheduling numerical optimization methods from a set of iterative 'oracle-based' techniques in order to obtain an as efficient as possible optimization process based on the given set of algorithms. Statements are formulated and proven about the scheduling problem and methods are proposed to solve this problem. The applicability of one of the proposed methods is demonstrated through a simple fuzzy rule based machine learning example.",
author = "Kriszti{\'a}n Bal{\'a}zs and L. K{\'o}czy",
year = "2010",
doi = "10.1007/978-3-642-14058-7_74",
language = "English",
isbn = "9783642140570",
volume = "81 PART 2",
series = "Communications in Computer and Information Science",
pages = "719--728",
booktitle = "Communications in Computer and Information Science",

}

TY - GEN

T1 - A remark on adaptive scheduling of optimization algorithms

AU - Balázs, Krisztián

AU - Kóczy, L.

PY - 2010

Y1 - 2010

N2 - In this paper the scheduling problem of optimization algorithms is defined. This problem is about scheduling numerical optimization methods from a set of iterative 'oracle-based' techniques in order to obtain an as efficient as possible optimization process based on the given set of algorithms. Statements are formulated and proven about the scheduling problem and methods are proposed to solve this problem. The applicability of one of the proposed methods is demonstrated through a simple fuzzy rule based machine learning example.

AB - In this paper the scheduling problem of optimization algorithms is defined. This problem is about scheduling numerical optimization methods from a set of iterative 'oracle-based' techniques in order to obtain an as efficient as possible optimization process based on the given set of algorithms. Statements are formulated and proven about the scheduling problem and methods are proposed to solve this problem. The applicability of one of the proposed methods is demonstrated through a simple fuzzy rule based machine learning example.

UR - http://www.scopus.com/inward/record.url?scp=84876909010&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876909010&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14058-7_74

DO - 10.1007/978-3-642-14058-7_74

M3 - Conference contribution

AN - SCOPUS:84876909010

SN - 9783642140570

VL - 81 PART 2

T3 - Communications in Computer and Information Science

SP - 719

EP - 728

BT - Communications in Computer and Information Science

ER -