Results 251 to 260 of about 11,183 (286)
Some of the next articles are maybe not open access.
Synthese, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On Minimal and Quasi-minimal Linear Codes
2013Minimal linear codes are linear codes such that the support of every codeword does not contain the support of another linearly independent codeword. Such codes have applications in cryptography, e.g. to secret sharing. We here study minimal codes, give new bounds and properties and exhibit families of minimal linear codes.
Gérard D. Cohen +2 more
openaire +1 more source
Minimal usco and minimal cusco maps
2015For topological spaces \(X\) and \(Y\), a set-valued map \(F:X \rightsquigarrow Y\) is said to be usco if it is upper semicontinuous and nonempty compact-valued. When \(Y\) is a linear topological space, an usco convex-valued map \(F:X\rightsquigarrow Y\) is said to be cusco. An usco (resp.
Hola, Lubica, Holy, Dusan
openaire +2 more sources
Local minimizers versus X-local minimizers
Optimization Letters, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akhtar A. Khan, Dumitru Motreanu
openaire +3 more sources
Economic Theory, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Minimal and almost minimal reaction systems
Natural Computing, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
ACM Transactions on Algorithms, 2009
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the network while minimizing
Erik D. Demaine +5 more
openaire +3 more sources
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects (representing anything from a robot swarm or firefighter team to map labels or network messages) to achieve a global property of the network while minimizing
Erik D. Demaine +5 more
openaire +3 more sources
Alternating Minimization as Sequential Unconstrained Minimization: A Survey
Journal of Optimization Theory and Applications, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
SIAM Journal on Control and Optimization, 2012
Among many other things, Oberst proved in his fundamental paper that controllability is equivalent to minimality in a transfer equivalence class. In this paper we directly and explicitly describe minimal systems in terms of transfer functions. A transfer function is a purely algebraic object that is associated to a linear differential system and that ...
openaire +1 more source
Among many other things, Oberst proved in his fundamental paper that controllability is equivalent to minimality in a transfer equivalence class. In this paper we directly and explicitly describe minimal systems in terms of transfer functions. A transfer function is a purely algebraic object that is associated to a linear differential system and that ...
openaire +1 more source
Minimal Words in a Minimal Syntax
1998In Minimal Words in a Minimal Syntax the author combines a detailed description of the morphological structure of words in Swedish with a daring new approach to theoretical morphology, based on the Minimalist Program of Chomsky (1995) (as developed for syntactic structure). The X-bar theoretic approach to word structure of the Principles and Parameters
openaire +1 more source