Results 21 to 30 of about 2,347,375 (169)
Location and Coverage Analysis of Bike- Sharing Stations in University Campus
Business Systems Research, 2018 Background: Bike-sharing programmes have become popular in a large number of cities in order to facilitate bicycle use. Determining the location of bike sharing stations is vital to success of these programmes.
Mete Suleyman +2 more
doaj +1 more source
Application of ant colony optimization metaheuristic on set covering problems
Mathematics in Applied Sciences and Engineering, 2022 Ant Colony Optimization (ACO) metaheuristic is a multi-agent system in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem.
Christian Alvin Buhat +2 more
doaj +1 more source
Covering Arrays via Set Covers
Electronic Notes in Discrete Mathematics, 2018 Abstract In this paper, we provide yet another construction on how to map problems pertaining covering arrays to specialized set cover problems. With this mapping it is possible to compute optimal covering arrays via minimal solutions of the generated set cover problem.
Ludwig Kampel +2 more
openaire +1 more source
The solvability of groups with nilpotent minimal coverings [PDF]
, 2014 A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a proof that every
Blyth, Russell D. +2 more
core +2 more sources
Optimization Strategy of Information Interaction Maximum Flow Transmission in Vehicle Ad Hoc Network [PDF]
Jisuanji gongcheng, 2017 Aiming at the transmission instability problem when multiple users request a large number of data resources in intelligent vehicle network,this paper proposes a Set Covering Maximum Flow(SCMF) algorithm in mobile vehicle node environment.It uses set ...
TAN Dayu,LI Jingzhao,YANG Dayu,LI Zihao,YANG Gaoming
doaj +1 more source
Matrix Approaches for Covering-Based Multigranulation Fuzzy Rough Set Models
Journal of Mathematics, 2023 Multigranulation rough set theory is one of the most effective tools for data analysis and mining in multicriteria information systems. Six types of covering-based multigranulation fuzzy rough set (CMFRS) models have been constructed through fuzzy β ...
Zaibin Chang, Junchao Wei
doaj +1 more source
On Asymmetric Coverings and Covering Numbers [PDF]
, 2002 An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T|
Applegate, David +2 more
core +5 more sources
Minimal Covers and Arithmetical Sets [PDF]
Proceedings of the American Mathematical Society, 1970 If a a and b b are degrees of unsolvability, a a is called a minimal cover of b b if b > a b > a and no degree c c satisfies b > c > a b > c > a .
Jockusch, Carl G., Soare, Robert I.
openaire +1 more source
Dynamic Floating Stations Model for Emergency Medical Services with a Consideration of Traffic Data
ISPRS International Journal of Geo-Information, 2020 To equally distribute the workload and minimize the travel distance for fire departments, we developed a new dynamic floating stations model (DFSM) to target traffic-related emergency medical services (EMS) during peak hours.
Chih-Hong Sun +3 more
doaj +1 more source
Covering t-sets with (t+2)-sets
Discrete Applied Mathematics, 1999 Let \(X\) be a \(v\)-set of points and \({\mathcal B}\) be a family of \(k\)-subsets of \(X\), called blocks. Then the pair \((X,{\mathcal B})\) is called a \(t\)-\((v,k,\lambda)\) covering design if each \(t\)-subset of \(X\) is contained in (or is covered by) at least \(\lambda\) blocks. The minimum size of \({\mathcal B}\) is denoted by \(C_{\lambda}
Nurmela, Kari J. +1 more
openaire +2 more sources