982 search results - page 129 / 197 » Solving Steiner tree problems in graphs to optimality |
121
Voted
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a new method for transductive learning, which can be seen as a transductive version of the k nearest-neighbor classifier. Unlike for many other transductive learning me...
107
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...
98
Voted
RECOMB
2002
Springer
16 years 27 days ago
2002
Springer
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
95
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
126
Voted
DCOSS
2011
Springer
14 years 11 days ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...