1974 search results - page 44 / 395 » Conditional Purchase Orders |
AAAI
2011
12 years 9 months ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
RSEISP
2007
Springer
14 years 3 months ago
2007
Springer
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the de...
AAAI
1998
13 years 11 months ago
1998
RecentlyFtwo new backtracking algorithmsF dynamic backtracking (DB)and partial order dynamicbacktracking (PDB) have been presented. These algorithms have the property to be additi...
ILP
2004
Springer
14 years 3 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
FOIKS
2008
Springer
13 years 11 months ago
2008
Springer
The area of knowledge merging is concerned with merging conflicting information while preserving as much as possible. Most proposals in the literature work with knowledge bases exp...