4302 search results - page 340 / 861 » Index Pairs Algorithms |
117
click to vote
ICMLA
2004
15 years 6 months ago
2004
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
143
click to vote
ESA
2010
Springer
15 years 6 months ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
122
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...
221
Voted
IPL
2006
15 years 4 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
143
click to vote
JMLR
2006
15 years 4 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...