Results 1 to 10 of about 1,714,979 (285)
An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion.
Thomas Place, Marc Zeitoun
doaj +4 more sources
Multi-objective database queries in combined knapsack and set covering problem domains [PDF]
Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data.
Sean A. Mochocki +3 more
doaj +2 more sources
The Lebesgue universal covering problem
In 1914 Lebesgue defined a 'universal covering' to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by various ...
John C. Baez +2 more
doaj +5 more sources
A fuzzy graph G is stated to have a set of trees as its tree cover if all the vertices of G are in their union. The maximum weight tree in the tree cover is assumed to be the cost of a tree cover for a fuzzy graph.
Anushree Bhattacharya, Madhumangal Pal
doaj +1 more source
Estimations of Covering Functionals of Convex Bodies Based on Relaxation Algorithm
Estimating covering functionals of convex bodies is an important part of Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a long-standing open problem from convex and discrete geometry.
Man Yu +4 more
doaj +1 more source
On reserve and double covering problems for the sets with non-Euclidean metrics [PDF]
The article is devoted to Circle covering problem for a bounded set in a two-dimensional metric space with a given amount of circles. Here we focus on a more complex problem of constructing reserve and multiply coverings.
Lempert Anna +2 more
doaj +1 more source
A Flexible Framework for Covering and Partitioning Problems in Indoor Spaces
Utilizing indoor spaces has become important with the progress of localization and positioning technologies. Covering and partitioning problems play an important role in managing, indexing, and analyzing spatial data.
Sung-Hwan Kim, Ki-Joune Li, Hwan-Gue Cho
doaj +1 more source
A heuristic method for bi-decomposition of partial Boolean functions
The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source
Covering collections and a challenge problem of Serre [PDF]
We answer a challenge of Serre by showing that every rational point on the projective curve X$^4$ + Y$^4$ = 17 Z$^4$ is of the form ($\pm$1, $\pm$2, 1) or ($\pm$2, $\pm$1, 1).
Flynn, E. V., Wetherell, J. L.
core +2 more sources
Set Covering Problem in Transport Nets Expanding Models [PDF]
The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life.
Dušan TEICHMANN +2 more
doaj +1 more source

