๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

H. Almuallim, An efficient algorithm for optimal of decision trees


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
69 KB
Volume
83
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis


Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without the need of close observation by the manager.


๐Ÿ“œ SIMILAR VOLUMES


An evolutionary algorithm for constructi
โœ Lior Rokach ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 232 KB

Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi

A New Efficient Algorithm for Embedding
โœ Volker Heun; Ernst W. Mayr ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making it desirable to simulate binary trees on a hypercube. In this paper, we present a simple one-to-one embedding of arbitrar

An efficient algorithm for optimizing th
โœ Hyungkeun Ahn; M. El-Nokali; Deuk-Young Han ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 195 KB

## Abstract A physical model for AlGaAs/GaAs heterojunction bipolar transistor with different emitter and base structures is proposed. The recombination currents in various depletion regions of the device are derived and are used to calculate the collector current in the range of 300โ€“600 K. The the

Efficient Parallel Algorithms for Optima
โœ Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce