Suchergebnisse - Computations on discrete structures General Terms Algorithms

Evolutionary Computation von Alavi, Amir, Wang, Gai-Ge

“… Computational intelligence is a general term for a class of algorithms designed by nature's wisdom and human intelligence …”
Volltext

Foundations of Software Science and Computation Structures: 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II von Kobayashi, Naoki, Worrell, James

“… The two open access volumes LNCS 14574 and 14575 constitute the proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2024, which took …”
Volltext

Graph Clustering Via a Discrete Uncoupling Process von Van Dongen, Stijn

“… A discrete uncoupling process for finite spaces is introduced, called the Markov Cluster Process or the MCL process …”
Volltext

Error Bounds for Discrete-Continuous Free Flight Trajectory Optimization von Borndörfer, Ralf, Danecker, Fabian, Weiser, Martin

“… Highly efficient discrete shortest path algorithms exist and can be used directly for computing starting points for locally convergent optimal control methods …”
Volltext

Lovász-Type Theorems and Game Comonads von Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“… Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is …”
Volltext

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations von Ushijima-Mwesigwa, Hayato, Hyman, Jeffrey D., Hagberg, Aric, Safro, Ilya, Karra, Satish, Gable, Carl W., Sweeney, Matthew R., Srinivasan, Gowri

“… to balance work-loads and minimize communication across all processors. The discrete structure …”
Volltext

Online maximum matching with recourse von Angelopoulos, Spyros, Dürr, Christoph, Jin, Shendan

“… . An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other …”
Volltext

Fast Graph Fourier Transforms Based on Graph Symmetry and Bipartition von Lu, Keng-Shih, Ortega, Antonio

“… However, unlike the discrete Fourier transform, the GFT typically does not have a fast algorithm …”
Volltext

Increasing consecutive patterns in words von Yang, Mingjia, Zeilberger, Doron

“… . Our approach yields an O ( n s + 1 ) algorithm to enumerate words in 1 s … n s , avoiding the consecutive pattern 1 …”
Volltext

Schnyder Decompositions for Regular Plane Graphs and Application to Drawing von Bernardi, Olivier, Fusy, Éric

“… . As in the case of Schnyder woods ( d =3), there are alternative formulations in terms of orientations (“fractional …”
Volltext

Discrete-Time Linear-Quadratic Dynamic Games von Pachter, M., Pham, K. D.

“… ). In discrete-time the cost function contains product terms between the decision variables which complicates the analysis compared to its continuous-time analogue …”
Volltext

Algorithmic Foundations for Social Advancement: Recent Progress on Theory and Practice von Minato, Shin-ichi, Uno, Takeaki, Yasuda, Norihito, Horiyama, Takashi, Kawarabayashi, Ken-ichi, Yamashita, Shigeru, Ono, Hirotaka

“… -life problems, thereby driving social transformation and advancement. Formulating such social problems into well-defined mathematical or computational terms …”
Volltext

Restricted structure predictive control for linear and nonlinear systems von Grimble, Mike J., Majecki, Pawel

“… An optimal predictive control algorithm is introduced for the control of linear and nonlinear discrete-time multivariable systems …”
Volltext

Scalable Zero Knowledge Via Cycles of Elliptic Curves von Ben-Sasson, Eli, Chiesa, Alessandro, Tromer, Eran, Virza, Madars

“… ), and are desired when communication is expensive, or the verifier is computationally weak. Existing zk-SNARK implementations have severe scalability limitations, in terms of space complexity as a function of the size of the computation being proved (e.g …”
Volltext

On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems von Ding, Kuang-Yu, Lam, Xin-Yee, Toh, Kim-Chuan

“… appropriate proximal terms to decompose the computation of the dual variable blocks …”
Volltext

Robust memory state feedback model predictive control for discrete-time uncertain state delayed systems von Ji, D.H., Park, Ju H., Yoo, W.J., Won, S.C.

“… We derive a sufficient condition for cost monotonicity in terms of LMI, which can be easily solved by an efficient convex optimization algorithm …”
Volltext

Counting Triangulations and Other Crossing-Free Structures via Onion Layers von Alvarez, Victor, Bringmann, Karl, Curticapean, Radu, Ray, Saurabh

“… Let P be a set of n points in the plane. A crossing-free structure on P is a straight-edge plane graph with vertex set P …”
Volltext

Computational aspects of monotone dualization: A brief survey von Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

“… It is also one of the few problems whose precise tractability status (in terms of polynomial-time solvability …”
Volltext

Segments and Hilbert schemes of points von Cioffi, Francesca, Lella, Paolo, Marinari, Maria Grazia, Roggero, Margherita

“… Using results obtained from a study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal …”
Volltext

Guest Editorial Evolutionary Computation Meets Deep Learning von Ding, Weiping, Pedrycz, Witold, Yen, Gary G., Xue, Bing

“… vision, industrial control and automation, etc. The motivation of deep learning is primarily to establish a model to simulate the neural connection structure of the human brain …”
Volltext