Results 41 to 50 of about 2,298,639 (295)
Minimizing the Height of Simple Tangles
Journal of Graph Algorithms and ApplicationsA tangle $T$ of height $h$ describes the ordering of $n$ elements called wires on each of $h$ levels. A pair of wires $ab$ is called a swap. Between any two adjacent levels only the ordering of adjacent wires may swap and each wire may participate in ...
Jakob Baumann, Ignaz Rutter
doaj +1 more source
Evaluating the Effects of the Clique Selection in Exact Graph Coloring Algorithms
, 2011 It is a common practice in exact enumerative algorithms for graph colouring to find a clique of maximum cardinality and to fix the colours of this subgraph before proceeding with implicit enumeration on the remainder of the graph.
International Journal O. F. Operational Research +4 more
core +1 more source
An Algorithm for Exact Division
Journal of Symbolic Computation, 1993 Division of long integers is a frequently performed task in computer algebra. The common algorithms used for that purpose rely on computing quotient and remainder (IQR), even when it is known in advance that the latter one is zero. The author proposes to exploit the fact that the division is exact and gives a time-saving algorithm (EDIV) starting from ...
openaire +2 more sources
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
Algorithms, 2009 Non-preemptive schedulers, despite their many discussed drawbacks, remain a very popular choice for practitioners of real-time and embedded systems. The non-preemptive ‘thrift’ cyclic scheduler—variations of which can be found in other application areas ...
Michael J. Short
doaj +1 more source
Exact and Heuristic Algorithms for Convex Polygon Decomposition
MathematicsConvex decomposition plays a central role in computational geometry and is a key preprocessing step in applications such as robotic motion planning, 2D packing, pattern recognition, and manufacturing.
Johana Milena Martínez Contreras +4 more
doaj +1 more source
Exact algorithms for the rectilinear block packing problem
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2018 The rectilinear block packing problem is a problem of packing a set of rectilinear blocks into a larger rectangular container with fixed width and unrestricted height. A rectilinear block is a polygonal block whose interior angles are either 90◦ or 270◦.
Ken MATSUSHITA +4 more
doaj +1 more source
07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes [PDF]
, 2007 From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.
Spinrad, Jeremy P. +3 more
core +1 more source
MathematicsPort seaside scheduling, involving berth allocation, quay crane, and tugboat scheduling, is central to intelligent port operations. This survey reviews and statistically analyzes 152 academic publications from 2000 to 2025 that focus on optimization ...
Yaqiong Lv +3 more
doaj +1 more source
Practical algorithms for linear boolean-width [PDF]
, 2015 In this paper, we give a number of new exact algorithms and heuristics to compute linear boolean decompositions, and experimentally evaluate these algorithms.
Brinke, Chiel B ten +10 more
core +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Japan has one of the highest dialysis prevalence rates worldwide and a shrinking, aging population. Whether dialysis burden has entered a sustained post‐peak phase or whether recent declines partly reflect pandemic‐related disruptions remains uncertain.
Hatice Şahin +2 more
wiley +1 more source