13987 search results - page 338 / 2798 » The Two Guards Problem |
133
click to vote
SIAMDM
2008
15 years 6 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
147
click to vote
JMLR
2006
15 years 6 months ago
2006
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
201
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
167
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
161
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a novel technique for automated problem decomposition to address the problem of scalability in reinforcement learning. Our technique makes use of a set of near-optimal ...