2218 search results - page 224 / 444 » Testing Expressibility Is Hard |
ANCS
2007
ACM
14 years 2 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
CIKM
2008
Springer
14 years 23 days ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
GECCO
2008
Springer
13 years 12 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
KI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
SIGIR
2008
ACM
13 years 10 months ago
2008
ACM
It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domai...