16404 search results - page 783 / 3281 » A set coverage problem |
200
click to vote
CPM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
202
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
229
Voted
GLOBECOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
203
click to vote
WIDM
2006
ACM
16 years 1 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
192
Voted
CEC
2005
IEEE
16 years 1 months ago
2005
IEEE
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...