Results 11 to 20 of about 8,892,749 (345)
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
, 2008 Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
N. Mladenović +12 more
core +7 more sources
Discrete Multistage Optimization and Hierarchical Market [PDF]
Nonlinear Analysis, 2006 New simple form of mixed solutions is described by bilinear continuous optimization processes. It enables investigate an analytic solutions and the connection between discrete and continuous optimization processes.
V. J. Bistrickas, N. Šimelienė
doaj +2 more sources
Finance and Economics Discussion Series, 1999 This paper investigates the desirability of adopting a rule in favor of discretionary monetary policy in a model exhibiting Kydland and Prescott's dynamic inconsistency problem. We deviate from earlier work by adopting assumptions regarding policymaker preferences and inflation dynamics that are compatible with empirically motivated models used for ...
Lengwiler, Yvan, Orphanides, Athanasios
openaire +2 more sources
Operations Research Perspectives, 2021 This paper mainly studies two topics: linear complementarity problems for modeling electricity market equilibria and optimization under uncertainty. We consider both perfectly competitive and Nash–Cournot models of electricity markets and study their ...
Anja Kramer +2 more
doaj +1 more source
Optimal Discrete Slicing [PDF]
ACM Transactions on Graphics, 2017 Slicing is the procedure necessary to prepare a shape for layered manufacturing. There are degrees of freedom in this process, such as the starting point of the slicing sequence and the thickness of each slice. The choice of these parameters influences the manufacturing process and its result: The number of slices significantly affects the time needed ...
Alexa, Marc +2 more
openaire +3 more sources
Discrete Optimization for Unsupervised Sentence Summarization with Word-Level Extraction [PDF]
Annual Meeting of the Association for Computational Linguistics, 2020 Automatic sentence summarization produces a shorter version of a sentence, while preserving its most important information. A good summary is characterized by language fluency and high information overlap with the source sentence.
Raphael Schumann +4 more
semanticscholar +1 more source
A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization [PDF]
ACM Transactions on Evolutionary Learning and Optimization, 2020 The theory of evolutionary computation for discrete search spaces has made significant progress since the early 2010s. This survey summarizes some of the most important recent results in this research area.
Benjamin Doerr, Frank Neumann
semanticscholar +1 more source
Interpretable Sequence Classification via Discrete Optimization [PDF]
AAAI Conference on Artificial Intelligence, 2020 Sequence classification is the task of predicting a class label given a sequence of observations. In many applications such as healthcare monitoring or intrusion detection, early classification is crucial to prompt intervention.
Maayan Shvo +3 more
semanticscholar +1 more source
Discrete Optimization with Decision Diagrams [PDF]
INFORMS Journal on Computing, 2016 We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, and restricted BDDs supply a primal heuristic.
David Bergman +3 more
semanticscholar +3 more sources
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part I [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions.
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source