3946 search results - page 189 / 790 » The computational complexity of choice sets |
190
click to vote
IWANN
2001
Springer
15 years 11 months ago
2001
Springer
One of the main research concern in neural networks is to find the appropriate network size in order to minimize the trade-off between overfitting and poor approximation. In this ...
159
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Mass-produced goods tend to be highly standardized in order to maximize manufacturing efficiencies. Some high-value goods with limited production quantities remain much less stand...
164
Voted
AAAI
1996
15 years 8 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
165
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper we discuss object detection when only a small number of training examples are given. Specifically, we show how to incorporate a simple prior on the distribution of n...
155
click to vote
SOFSEM
2004
Springer
15 years 12 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...