1433 search results - page 53 / 287 » On Covering Problems of Rado |
CCCG
2010
15 years 1 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
100
click to vote
WWW
2005
ACM
16 years 15 days ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
105
click to vote
ICMCS
2008
IEEE
15 years 6 months ago
2008
IEEE
As an important attribute directly influencing the steganographic scheme, the embedding efficiency is defined as the average number of random data bits per one embedding change...
101
click to vote
AAAI
2006
15 years 1 months ago
2006
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
111
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...