3600 search results - page 216 / 720 » The settling-time reducibility ordering |
161
click to vote
IJCAI
2007
15 years 8 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
149
click to vote
CSREAESA
2004
15 years 8 months ago
2004
Adders are some of the most critical data path circuits requiring considerable design effort in order to "squeeze" out as much performance gain as possible. Many adder d...
183
click to vote
ECIR
2003
Springer
15 years 8 months ago
2003
Springer
In order to reduce human efforts, there has been increasing interest in applying active learning for training text classifiers. This paper describes a straightforward active learni...
146
click to vote
WSC
2004
15 years 8 months ago
2004
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
173
click to vote
FLAIRS
1998
15 years 8 months ago
1998
Manual generation of training examples for supervised learning is an expensive process. One way to reduce this cost is to produce training instances that are highly informative. T...