Results 41 to 50 of about 719,735 (175)
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT [PDF]
, 2015 Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F.
B Aspvall +12 more
core +3 more sources
Mathematical and Computational Applications, 2018 In this article, we present a modified auxiliary equation method. We harness this modification in three fundamental models in the biological branch of science.
Mostafa M. A. Khater +2 more
doaj +1 more source
IEEE Access, 2022 Designing an efficient data sorting algorithm that requires less time and space complexity is essential for computer science, different engineering disciplines, data mining systems, wireless networks, and the Internet of things.
Shahriar Shirvani Moghaddam +1 more
doaj +1 more source
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints [PDF]
Symposium on Theoretical Aspects of Computer Science, 2018 We consider the standard ILP Feasibility problem: given an integer linear program of the form {Ax = b, x ⩾ 0}, where A is an integer matrix with k rows and ℓ columns, x is a vector of ℓ variables, and b is a vector of k integers, we ask whether there ...
D. Knop +2 more
semanticscholar +1 more source
Partitions of an Integer into Powers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results.
Matthieu Latapy
doaj +1 more source
A phase transition in the distribution of the length of integer partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We assign a uniform probability to the set consisting of partitions of a positive integer $n$ such that the multiplicity of each summand is less than a given number $d$ and we study the limiting distribution of the number of summands in a random ...
Dimbinaina Ralaivaosaona
doaj +1 more source
Jurnal Sistem Informasi, 2012 Permasalahan konflik penjadwalan ruangan (timetabling) sering dihadapi hampir sebagian besar institusi akademis di Indonesia, salah satunya di Fakultas Ilmu Komputer Universitas Indonesia (Fasilkom UI).
Elly Matul Imah +4 more
doaj +3 more sources
Poset vectors and generalized permutohedra [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We show that given a poset $P$ and and a subposet $Q$, the integer points obtained by restricting linear extensions of $P$ to $Q$ can be explained via integer lattice points of a generalized permutohedron.
Dorian Croitoru +2 more
doaj +1 more source
A note on totally regular variables and Appell sequences in hypercomplex function theory [PDF]
, 2013 Series title : Lecture notes in computer science, vol. 7971, ISSN 0302-9743The aim of our contribution is to call attention to the relationship between totally regular variables, introduced by R. Delanghe in 1970, and Appell sequences with respect to the
F. Brackx +10 more
core +2 more sources
Optimizing Parallel Task Execution for Multi-Agent Mission Planning
IEEE Access, 2023 Multi-agent systems have received a tremendous amount of attention in many areas of research and industry, especially in robotics and computer science.
Branko Miloradovic +3 more
doaj +1 more source