1433 search results - page 54 / 287 » On Covering Problems of Rado |
104
click to vote
GECCO
2007
Springer
15 years 6 months 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...
CORR
2011
Springer
14 years 6 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...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
118
click to vote
ADMA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
DMCS
2003
15 years 1 months ago
2003
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...