12194 search results - page 235 / 2439 » Numberings Optimal for Learning |
144
click to vote
ALENEX
2007
15 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...
165
click to vote
COLT
1994
Springer
15 years 10 months ago
1994
Springer
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
154
click to vote
ISSAC
2004
Springer
15 years 12 months ago
2004
Springer
Let n/d ∈ Q, m be a positive integer and let u = n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d.
150
click to vote
ICTAI
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper extends carrier assignment models used in bid analysis for transportation procurement to incorporate shipper business considerations. These include restricting carrier ...
173
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In reinforcement learning, an agent interacting with its environment strives to learn a policy that specifies, for each state it may encounter, what action to take. Evolutionary c...