Sciweavers

5022 search results - page 112 / 1005
» Data structures and problem solving using Java
Sort
View
IJCAI
2003
14 years 11 months ago
Learning to Classify Texts Using Positive and Unlabeled Data
In traditional text classification, a classifier is built using labeled training documents of every class. This paper studies a different problem. Given a set P of documents of a ...
Xiaoli Li, Bing Liu
KER
2006
107views more  KER 2006»
14 years 9 months ago
Partitioning strategies for distributed association rule mining
In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, ...
Frans Coenen, Paul H. Leng
AUSAI
2008
Springer
14 years 12 months ago
Partial Order Hierarchical Reinforcement Learning
In this paper the notion of a partial-order plan is extended to task-hierarchies. We introduce the concept of a partial-order taskhierarchy that decomposes a problem using multi-ta...
Bernhard Hengst
TON
2002
91views more  TON 2002»
14 years 9 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
ECBS
2000
IEEE
97views Hardware» more  ECBS 2000»
15 years 2 months ago
Ensuring Structure and Behavior Correctness in Design Composition
The design of a large component-based software system typically involves the composition of different components. Instead of relying on a free composition of components, we advoca...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan