4255 search results - page 544 / 851 » On Learning Boolean Functions |
246
Voted
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
173
click to vote
CIKM
2004
Springer
16 years 1 days ago
2004
Springer
Automatically categorizing documents into pre-defined topic hierarchies or taxonomies is a crucial step in knowledge and content management. Standard machine learning techniques ...
210
click to vote
JAIR
2011
15 years 1 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
175
click to vote
AIED
2005
Springer
16 years 5 days ago
2005
Springer
This paper describes an approach for analysis of computer-supported learning processes utilizing logfiles of learners’ actions. We provide help to researchers and teachers in ...
164
click to vote
CE
2005
15 years 6 months ago
2005
Laboratory exercises, field observations and field trips are a fundamental part of many earth science and environmental science courses. Field observations and field trips can be ...