949 search results - page 14 / 190 » exact 2008 |
NIPS
2008
14 years 11 months ago
2008
Confidence-weighted (CW) learning [6], an online learning method for linear classifiers, maintains a Gaussian distributions over weight vectors, with a covariance matrix that repr...
EOR
2008
14 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
WALCOM
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
COR
2008
14 years 8 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
110
click to vote
CF
2008
ACM
14 years 12 months ago
2008
ACM
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...