A5063577050- Optimization and Search Problems
- Complexity and Algorithms in Graphs
- Optimization and Packing Problems
- Scheduling and Optimization Algorithms
- Advanced Manufacturing and Logistics Optimization
- Advanced Graph Theory Research
- Auction Theory and Applications
- graph theory and CDMA systems
- Computational Geometry and Mesh Generation
- Transportation and Mobility Innovations
- Advanced Wireless Network Optimization
- Distributed Control Multi-Agent Systems
- Graph Labeling and Dimension Problems
- VLSI and FPGA Design Techniques
- Advanced Bandit Algorithms Research
- Distributed systems and fault tolerance
- Metaheuristic Optimization Algorithms Research
- Distributed and Parallel Computing Systems
- Complex Network Analysis Techniques
- Mobile Ad Hoc Networks
- Advanced Clustering Algorithms Research
- Cryptography and Data Security
- Composite Structure Analysis and Optimization
- Tribology and Lubrication Engineering
- Nonlocal and gradient elasticity in micro/nano structures
University of Wrocław
2021-2022
Institute of Computer Science
2021-2022
Leipzig University
2021
Czech Academy of Sciences, Institute of Computer Science
2021
Gesellschaft Fur Mathematik Und Datenverarbeitung
2021
University of Bremen
2013-2020
Charles University
2014-2020
Staats- und Universitätsbibliothek Bremen
2013
Abstract By Fourier‐series expansion in thickness direction of the plate with respect to a basis scaled Legendre polynomials, several equivalent (and therefore exact) two‐dimensional formulations three‐dimensional boundary‐value problem linear elasticity weak formulation for constant are derived. These sets countably many PDEs, which power series squared parameter. For special case homogeneous monoclinic material, we obtain an approximative theory finitely PDEs and unknown variables by...
In the Multi-Level Aggregation Problem (MLAP), requests arrive at nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X T that contains its root. This serves all are pending in X, cost this equal total weight X. Each request also incurs waiting between arrival times. The objective minimize plus subtrees. MLAP generalization some well-studied optimization problems; for example, trees depth 1, equivalent TCP Acknowledgment Problem, while 2, it...
We break the barrier of $3/2$ for problem online load balancing with known makespan, also as bin stretching. In this problem, $m$ identical machines and optimal makespan are given. The a machine is total size all jobs assigned to it maximum machines. Jobs arrive goal assign each job while staying within small factor (the competitive ratio) makespan. present an algorithm that maintains ratio $139/93<1.495$ sufficiently large values $m$, improving previous bound $3/2$. value 3/2 represents...
Online Algorithms for Hierarchical Aggregation Problems Data and inventory aggregation problems arise in multicasting, sensor networks, communication organization hierarchies, supply chain management. These are naturally online, the sense that decisions need to be made without information about future requests. We study these with a general tree structure of links can used deliveries. This generalizes some well-studied optimization problems: trees depth one capture TCP acknowledgment...
Knapsack problems are among the most fundamental in optimization. In Multiple problem, we given multiple knapsacks with different capacities and items values sizes. The task is to find a subset of maximum total value that can be packed into without exceeding capacities. We investigate this problem special cases thereof context dynamic algorithms design data structures efficiently maintain near-optimal knapsack solutions for dynamically changing input. More precisely, handle arrival departure...