Results 41 to 50 of about 2,709,850 (294)
An Algorithm for Exact Division
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
On exact algorithms for the permutation CSP
In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables $V$ and a set of constraints C, in which constraints are tuples of elements of V. The goal is to find a total ordering of the variables, $π : V \rightarrow [1,...,|V|]$, which satisfies as many constraints as possible.
Kim, Eun Jung, Gonçalves, Daniel
openaire +5 more sources
Exact and Heuristic Multi-Robot Dubins Coverage Path Planning for Known Environments
Coverage path planning (CPP) of multiple Dubins robots has been extensively applied in aerial monitoring, marine exploration, and search and rescue. Existing multi-robot coverage path planning (MCPP) research use exact or heuristic algorithms to address ...
Lin Li +6 more
doaj +1 more source
Evaluating the effects of the clique selection in exact graph coloring algorithms
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 +10 more
core +1 more source
Port 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
Exact Algorithms for Biclique Coloring
Summary: A \(k\)-biclique-coloring of \(G\) is \(k\)-coloring of the vertices of \(G\) with no maximal monochromatic biclique. A recent work showed that determining if such a coloring exists is \(\Sigma_2^{\mathsf{P}}\)-complete for \(k>2\). We present algorithms to determine if a graph has a \(k\)-biclique-coloring: an \(\mathcal{O}^\ast(4^n)\)-time ...
Guilherme Gomes +2 more
openaire +2 more sources
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
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
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT [PDF]
We present improved exponential time exact algorithms for Max SAT. Our algorithms run in time of the form O(2^{(1-mu(c))n}) for instances with n variables and m=cn clauses.
Teruyama, Junichi +3 more
core +1 more source
An Improved Exact Algorithm for the Exact Satisfiability Problem [PDF]
The Exact Satisfiability problem, XSAT, is defined as the problem of finding a satisfying assignment to a formula $φ$ in CNF such that exactly one literal in each clause is assigned to be "1" and the other literals in the same clause are set to "0". Since it is an important variant of the satisfiability problem, XSAT has also been studied heavily and ...
openaire +4 more sources
Exact and Heuristic Algorithms for Convex Polygon Decomposition
Convex 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

