1263 search results - page 9 / 253 » A* with Bounded Costs |
AI
2000
Springer
14 years 11 months ago
2000
Springer
CHI
2009
ACM
16 years 9 days ago
2009
ACM
Community-based question and answer (Q&A) systems facilitate information exchange and enable the creation of reusable knowledge repositories. While these systems are growing i...
COMBINATORICS
2000
14 years 11 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...
85
Voted
ICML
2007
IEEE
16 years 16 days ago
2007
IEEE
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
AOR
2006
14 years 11 months ago
2006
The domination number, domn(A, n), of a heuristic A for the Asymmetric TSP is the maximum integer d = d(n) such that, for every instance I of the Asymmetric TSP on n cities, A pro...