21319 search results - page 489 / 4264 » An Approach for Method Reengineering |
225
Voted
AAAI
2011
14 years 7 months ago
2011
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
323
click to vote
CISIS
2011
IEEE
14 years 7 months ago
2011
IEEE
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
231
click to vote
JMLR
2012
13 years 9 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
204
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: A critical step in processing oligonucleotide microarray data is combining the information in multiple probes to produce a single number that best captures the express...
191
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...