Results 31 to 40 of about 118,288 (291)

Generalized backward induction: Justification for a folk algorithm [PDF]

open access: yes, 2019
I introduce axiomatically infinite sequential games that extend Kuhn’s classical framework. Infinite games allow for (a) imperfect information, (b) an infinite horizon, and (c) infinite action sets.
Kaminski, MM
core   +1 more source

Pruning Strategies for High Density ���Montmorency' Tart Cherry [PDF]

open access: yes, 2018
The tart cherry (Prunus cerasus) is the most significant fruit tree crop in Utah, accounting for roughly 51% of the total statewide commercial fruit acreage. In order to accommodate harvesting equipment, tart cherries are grown in conventional orchards with large trees spaced up to 5.5 meters apart.
openaire   +2 more sources

An Optimal Constrained Pruning Strategy for Decision Trees [PDF]

open access: yesINFORMS Journal on Computing, 2009
This paper is concerned with the optimal constrained pruning of decision trees. We present a novel 0–1 programming model for pruning the tree to minimize some general penalty function based on the resulting leaf nodes, and show that this model possesses a totally unimodular structure that enables it to be solved as a shortest-path problem on an ...
Sherali, Hanif D.   +2 more
openaire   +2 more sources

Converting Tall Spindle Apple Trees to Narrow Walls with Summer and Dormant Hedging Plus Root Pruning

open access: yesHortScience, 2023
Recently, some commercial apple growers have been adopting hedging as an alternative or supplement to hand-pruning. With increasing labor costs across the United States, alternatives to hand-pruning and current training systems are being considered.
Thiago Campbell   +2 more
doaj   +1 more source

Optimum graph cuts for pruning binary partition trees of polarimetric SAR images [PDF]

open access: yes, 2016
This paper investigates several optimum graph-cut techniques for pruning binary partition trees (BPTs) and their usefulness for the low-level processing of polarimetric synthetic aperture radar (PolSAR) images.
Foucher, Samuel   +1 more
core   +2 more sources

Efficient Geometric Pruning Strategies for Continuous Skyline Queries [PDF]

open access: yesISPRS International Journal of Geo-Information, 2017
The skyline query processing problem has been well studied for many years. The literature on skyline algorithms so far mainly considers static query points on static attributes. With the popular usage of mobile devices along with the increasing number of mobile applications and users, continuous skyline query processing on both static and dynamic ...
Jiping Zheng   +2 more
openaire   +1 more source

Mining High-Efficiency Itemsets with Negative Utilities

open access: yesMathematics
High-efficiency itemset mining has recently emerged as a new problem in itemset mining. An itemset is classified as a high-efficiency itemset if its utility-to-investment ratio meets or exceeds a specified efficiency threshold.
Irfan Yildirim
doaj   +1 more source

Pruning Optimization over Threshold-Based Historical Continuous Query

open access: yesAlgorithms, 2019
With the increase in mobile location service applications, spatiotemporal queries over the trajectory data of moving objects have become a research hotspot, and continuous query is one of the key types of various spatiotemporal queries. In this paper, we
Jiwei Qin, Liangli Ma, Qing Liu
doaj   +1 more source

Fine-Pruning: Joint Fine-Tuning and Compression of a Convolutional Network with Bayesian Optimization

open access: yes, 2017
When approaching a novel visual recognition problem in a specialized image domain, a common strategy is to start with a pre-trained deep neural network and fine-tune it to the specialized domain.
Mori, Greg   +2 more
core   +1 more source

Significant Subgraph Mining with Multiple Testing Correction [PDF]

open access: yes, 2015
The problem of finding itemsets that are statistically significantly enriched in a class of transactions is complicated by the need to correct for multiple hypothesis testing.
Borgwardt, Karsten M.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy