Results 21 to 30 of about 5,109,809 (289)
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
Applied Sciences, 2023 The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
Lower Bounds and Upper Bounds for MaxSAT [PDF]
, 2012 This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Federico Heras +2 more
openaire +2 more sources
MSE lower bounds conditioned by the energy detector [PDF]
, 2007 A wide variety of processing incorporates a binary detection test that restricts the set of observations for parameter estimation. This statistical conditioning must be taken into account to compute the Cramer-Rao bound (CRB) and more generally, lower ...
Chaumette, Eric +6 more
core +1 more source
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications, 2006 Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree.
Hans Bodlaender +2 more
doaj +1 more source
DLP in semigroups: Algorithms and lower bounds
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj +1 more source
Lower bounds for multi-pass processing of multiple data streams [PDF]
, 2009 This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-called mp2s-automata.
Schweikardt, Nicole
core +1 more source
Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
IEEE Access, 2019 In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known.
Ian Blanes +3 more
doaj +1 more source
Lower Bounds for Matrix Factorization [PDF]
computational complexity, 2021 We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various incarnations in computer science; the most significant being in the context of lower bounds for algebraic circuits which ...
Kumar, Mrinal, Volk, Ben Lee
openaire +5 more sources
The global rate of convergence for optimal tensor methods in smooth convex optimization [PDF]
Компьютерные исследования и моделирование, 2018 In this work we consider Monteiro - Svaiter accelerated hybrid proximal extragradient (A-HPE) framework and accelerated Newton proximal extragradient (A-NPE) framework.
Alexander Vladimirovich Gasnikov +4 more
doaj +1 more source