Results 31 to 40 of about 1,745,964 (294)
Combinatorial representations [PDF]
, 2011 23pp. Submitted to J. Combinatorial Theory (Series A)arXiv:1109.1216v1 [math.CO]23pp. Submitted to J. Combinatorial Theory (Series A)23pp. Submitted to J.
Maximilien Gadouleau +10 more
core +1 more source
Short Paper - A Note on Robust Combinatorial Optimization with Generalized Interval Uncertainty
Open Journal of Mathematical Optimization, 2023 In this paper, we consider a robust combinatorial optimization problem with uncertain weights and propose an uncertainty set that generalizes interval uncertainty by imposing lower and upper bounds on deviations of subsets of items.
Yaman, Hande
doaj +1 more source
Encoded expansion: an efficient algorithm to discover identical string motifs.
PLoS ONE, 2014 A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct
Aqil M Azmi, Abdulrakeeb Al-Ssulami
doaj +1 more source
Almost Optimal Searching of Maximal Subrepetitions in a Word
Mathematics, 2022 For some fixed δ such that ...
Roman Kolpakov
doaj +1 more source
Special Issue on Graph Algorithms
Algorithms, 2013 This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
Universally Balanced Combinatorial Optimization Games
Games, 2010 This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization ...
Xiaotie Deng, Gabrielle Demange
doaj +1 more source
Combinatorial Stratification of Complex Arrangements [PDF]
Journal of the American Mathematical Society, 1992 We present a method for discretizing complex hyperplane arrangements by encoding their topology into a finite partially ordered set of “sign vectors.” This is used in the following ways: (1) A general method is given for constructing regular cell complexes having the homotopy type of the complement of the arrangement.
Björner, Anders, Ziegler, Günter M.
openaire +1 more source
Sequence conservation and combinatorial complexity of
BMC Genomics, 2008 Background The presence of highly conserved sequences within cis-regulatory regions can serve as a valuable starting point for elucidating the basis of enhancer function.
Kuzin Alexander +5 more
doaj +1 more source
Maximum Likelihood Joint Tracking and Association in Strong Clutter
International Journal of Advanced Robotic Systems, 2013 We have developed a maximum likelihood formulation for a joint detection, tracking and association problem. An efficient non-combinatorial algorithm for this problem is developed in case of strong clutter for radar data.
Leonid I. Perlovsky, Ross W. Deming
doaj +1 more source
Combinatorial Abstractions of Dynamical Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Formal verification has been successfully developed in computer science for verifying combinatorial classes of models and specifications. In like manner, formal verification methods have been developed for dynamical systems.
Rafael Wisniewski
doaj +1 more source