1628 search results - page 289 / 326 » Partitioning Sets with Genetic Algorithms |
154
click to vote
PVLDB
2010
15 years 3 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
141
click to vote
AWIC
2003
Springer
15 years 10 months ago
2003
Springer
This paper describes a practical solution for the incorporation of security services in agents. From a set of basic user requirements, the agents will be able to find out the best ...
150
Voted
MST
2006
15 years 5 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
182
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
154
click to vote
GECCO
2007
Springer
15 years 11 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...