Results 21 to 30 of about 1,714,979 (285)
Bullying at School: Covering a Problem on the Facebook
Інтегровані комунікації, 2020 The article highlights the current problem: the situation of bullying in modern Ukrainian schools, its negative and longterm consequences for victims of bullying, as well as what are the risks for the bully (offender) in the future after bullying.
Anzhela Sliusarenko
doaj +1 more source
A new sequential covering strategy for inducing classification rules with ant colony algorithms [PDF]
, 2012 Ant colony optimization (ACO) algorithms have been successfully applied to discover a list of classification rules. In general, these algorithms follow a sequential covering strategy, where a single rule is discovered at each iteration of the algorithm ...
Freitas, Alex A. +2 more
core +3 more sources
MATHEMATICA SCANDINAVICA, 1995 One defines a subset \(\Lambda\subseteq\mathbb{R}\) to be uniformly discrete (u.d.) if there is an \(\varepsilon>0\) such that each pair in \(\Lambda\) is at least \(\varepsilon\) apart. For such \(\Lambda\) there is a natural density concept (lower uniform) \(d(\Lambda)\leq 1/\varepsilon\).
Knudsen, F.F. +2 more
openaire +1 more source
Two Neighbourhood-based Approaches for the Set Covering Problem
U.Porto Journal of Engineering, 2019 The Set Covering Problem is a well-known NP-complete problem which we address in this work. Due to its combinatorial nature heuristic methods, namely neighbourhood-based meta-heuristics, were used.
Eduardo Meca Castro
doaj +1 more source
Optimizing Ambulance Allocation in Dynamic Urban Environments: A Historic Data-Driven Approach
Applied Sciences, 2023 In this study, we present a methodology to solve the multi-period ambulance relocation problem based on historical data. We present a methodology to convert historical data in latitude–longitude coordinates into cell-based network data.
Seongho Kang, Taesu Cheong
doaj +1 more source
Unsplittable coverings in the plane [PDF]
, 2015 A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}.
A Asinowski +28 more
core +4 more sources
On Covering of Cylindrical and Conical Surfaces with Equal Balls
Известия Иркутского государственного университета: Серия "Математика"The article concerns the problem of covering the lateral surface of a right circular cylinder or a cone with equal balls. The surface is required to belong to their union, and the balls’ radius is minimal. The centers of the balls must lie on the covered
A. L. Kazakov +2 more
doaj +1 more source
Approximate Clustering via Metric Partitioning [PDF]
, 2016 In this paper we consider two metric covering/clustering problems - \textit{Minimum Cost Covering Problem} (MCC) and $k$-clustering. In the MCC problem, we are given two point sets $X$ (clients) and $Y$ (servers), and a metric on $X \cup Y$.
Bandyapadhyay, Sayan +1 more
core +2 more sources
ON RECTANGULAR COVERING PROBLEMS [PDF]
International Journal of Computational Geometry & Applications, 2009 Many applications like image processing, data compression or pattern recognition require a covering of a set of n points most often located in the (discrete) plane by rectangles due to specific cost constraints. In this paper we provide exact dynamic programming algorithms for covering point sets by regular rectangles, that have to obey certain ...
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro +10 more
wiley +1 more source