Suchergebnisse - Combinatorial and discrete structures related to algorithms

Combinatorial Generation Algorithms for Directed Lattice Paths von Shablya, Yuriy, Merinov, Arsen, Kruchinin, Dmitry

“… Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified properties …”
Volltext

Discrete swarm intelligence optimization algorithms applied to steel–concrete composite bridges von Martínez-Muñoz, D., García, J., Martí, J.V., Yepes, V.

“… Given this challenge, this study proposes a hybrid algorithm that integrates the unsupervised learning technique of k-means with continuous swarm intelligence metaheuristics to strengthen the latter’s performance …”
Volltext

Combinatorial structure of rigid transformations in 2D digital images von Ngo, Phuc, Kenmochi, Yukiko, Passat, Nicolas, Talbot, Hugues

“… ×N by a combinatorial structure. ► We describe this structure which has a space complexity O(N9). ► We propose an (exact computation …”
Volltext

A combinatorial problem related to sparse systems of equations von Horak, Peter, Semaev, Igor, Tuza, Zsolt

“… It turns out that the solution of a combinatorial MaxMinMax problem provides an upper bound on the average computational complexity of those methods …”
Volltext

Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors von Sato, Shun

“… matrices, whereas the previous algorithms find them separately for a specified order k . The efficiency of the algorithm is based on the discrete concavity related …”
Volltext

Contraction Bidimensionality of Geometric Intersection Graphs von Baste, Julien, Thilikos, Dimitrios M.

“… . A graph class G has the SQG C property if every graph G ∈ G has treewidth O ( bcg ( G ) c ) for some 1 ≤ c < 2 . The SQG C property is important for algorithm design …”
Volltext

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems von Yu, Xue, Chen, Wei-Neng, Gu, Tianlong, Zhang, Huaxiang, Yuan, Huaqiang, Kwong, Sam, Zhang, Jun

“… This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs …”
Volltext

Faster parameterized algorithms for minor containment von Adler, Isolde, Dorn, Frederic, Fomin, Fedor V., Sau, Ignasi, Thilikos, Dimitrios M.

“… The derivation of a polynomial-time algorithm for H - Minor containment is one of the most important and technical parts of the Graph Minor Theory of Robertson and Seymour and it is …”
Volltext

Effective multi-objective discrete optimization of Truss-Z layouts using a GPU von Zawidzki, Machi, Szklarski, Jacek

“… •A novel framework for Truss-Z layout optimization is presented.•It is based on image processing, evolutionary algorithm …”
Volltext

Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing von Damiand, Guillaume, Lienhardt, Pascal

“… It focuses on two subclasses of combinatorial maps: n-Gmaps and n-maps. The book presents the data structures, operations, and algorithms that are useful in handling subdivided geometric objects …”
Volltext

Bayesian Optimization Using Simulation-Based Multiple Information Sources over Combinatorial Structures von Sabbatella, Antonio, Ponti, Andrea, Candelieri, Antonio, Archetti, Francesco

“… machine learning algorithms, where one could use a subset of the full training set or even a smaller related dataset …”
Volltext

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms von Bourgeois, Nicolas, Escoffier, Bruno, Paschos, Vangelis Th

“… Using ideas and results from polynomial time approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time …”
Volltext

Power of Enumeration -- BDD/ZDD-Based Techniques for Discrete Structure Manipulation von Minato, Shin-Ichi

“… Discrete structures are foundational materials for computer science and mathematics, which are related to set theory, symbolic logic, inductive proof, graph theory, combinatorics, probability theory, etc …”
Volltext

Introducing Poset-Based Connected n-Manifolds and P-well-composedness in Partially Ordered Sets von Boutry, Nicolas

“… In discrete topology, discrete surfaces are well-known for their strong topological and regularity properties …”
Volltext

Efficient enumeration of solutions produced by closure operations von Mary, Arnaud, Strozecki, Yann

“… In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that …”
Volltext

V-Order: New combinatorial properties & a simple comparison algorithm von Alatabbi, Ali, Daykin, Jacqueline W., Kärkkäinen, Juha, Sohel Rahman, M., Smyth, W.F.

“… ; in particular, a fast, simple on-line V-order comparison algorithm that requires no auxiliary data structures …”
Volltext

Prediction of 3D RNA Structures from Sequence Using Energy Landscapes of RNA Dimers: Application to RNA Tetraloops von Riveros, Ivan Isaac, Yildirim, Ilyas

“… ), a physics-based fragment assembly method for predicting 3D RNA structures from sequence. Using a fragment library created using discrete path sampling calculations …”
Weitere Angaben

The study of unfoldable self-avoiding walks - Application to protein structure prediction software von Guyeux, Christophe, Nicod, Jean-Marc, Philippe, Laurent, Bahi, Jacques M

“… They are of great interest as, for example, they are the basis of protein structure prediction (PSP) in bioinformatic …”
Weitere Angaben

Lattice paths with catastrophes von Banderier, Cyril, Wallner, Michael

“… Furthermore, we prove several formulae for related combinatorial structures conjectured in the On-Line Encyclopedia of Integer Sequences. Thanks to the kernel method and via analytic combinatorics, we provide the enumeration and limit laws of these "lattice paths with catastrophes" for any finite set of jumps. We end with an algorithm to generate such lattice paths uniformly at random. Comment: 32 pages …”
Volltext

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs von Bergé, Pierre, Ducoffe, Guillaume, Habib, Michel

“… ? We propose the first combinatorial algorithm computing exactly all eccentricities of a median graph in truly subquadratic time …”
Volltext