Sciweavers

1689 search results - page 238 / 338
» Proximate point searching
Sort
View
INFORMS
2008
62views more  INFORMS 2008»
15 years 4 months ago
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Huseyin Topaloglu
IJCAT
2007
78views more  IJCAT 2007»
15 years 4 months ago
Enhanced SEA algorithm and fingerprint classification
: This paper proposes the Enhanced Shrinking and Expanding Algorithm (ESEA) with a new categorization method. The ESEA overcomes anomalies in the original Shrinking and Expanding A...
Li-min Liu, Ching-Yu Huang, Tian-Shyr Dai, George ...
JCIT
2007
111views more  JCIT 2007»
15 years 4 months ago
Edge Closing of Synthetic and Real Images using Polynomial Fitting
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as inco...
M. Benjelloun, H. J. Tellez Oliva, R. Prevot
AICOM
2004
92views more  AICOM 2004»
15 years 4 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu
CSDA
2004
81views more  CSDA 2004»
15 years 3 months ago
A note on split selection bias in classification trees
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
Y.-S. Shih