5624 search results - page 65 / 1125 » On Conditional Covering Problem |
164
click to vote
ICMCS
2008
IEEE
16 years 18 days 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...
163
click to vote
AAAI
2006
15 years 7 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...
175
click to vote
ESA
2007
Springer
16 years 10 days 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...
169
click to vote
GECCO
2007
Springer
16 years 9 days ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
162
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...