Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,197,196 papers from all fields of science
Search
Sign In
Create Free Account
Prune and search
Prune and search is a method of solving optimization problems suggested by Nimrod Megiddo in 1983. The basic idea of the method is a recursive…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algorithmic paradigm
Bounding sphere
Master theorem
Recurrence relation
Expand
Broader (1)
Linear programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Orchard performance of new plum cultivars on two rootstocks in a trial at Holovousy in 1998–2003
J. Blažek
,
R. Vávra
,
I. Pištěková
2018
Corpus ID: 56227496
Thirteen plum cultivars on two rootstocks (Myrobalan and Wangenheim Prune seedlings) were studied in a trial established in the…
Expand
2013
2013
Klasifikasi Teks Pesan Spam Menggunakan Algoritma Naïve Bayes
Ika Novita Dewi
,
C. Supriyanto
2013
Corpus ID: 142888144
Intensitas pengiriman teks pesan spam melalui layanan sms semakin meningkat seiring dengan meningkatnya trafik komunikasi. Hal…
Expand
2012
2012
Branch-and-Mincut: Global Optimization for Image Segmentation with High-Level Priors
V. Lempitsky
,
A. Blake
,
C. Rother
Journal of Mathematical Imaging and Vision
2012
Corpus ID: 1960854
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from low…
Expand
2011
2011
A Multi-objective Genetic Algorithm for Pruning Support Vector Machines
Mohamed Farouk Abdel Hady
,
Wesam Herbawi
,
M. Weber
,
F. Schwenker
IEEE International Conference on Tools with…
2011
Corpus ID: 8809607
Support vector machines (SVMs) often contain a large number of support vectors which reduce the run-time speeds of decision…
Expand
2011
2011
Continuous aggregate nearest neighbor queries
Hicham G. Elmongui
,
M. Mokbel
,
W. Aref
GeoInformatica
2011
Corpus ID: 1781793
This paper addresses the problem of continuous aggregate nearest-neighbor (CANN) queries for moving objects in spatio-temporal…
Expand
2010
2010
Efficient approximate SPARQL querying of Web of Linked Data
B. Reddy
,
P.Sreenivasa Kumar
Uncertainty Reasoning for the Semantic Web
2010
Corpus ID: 301278
The web of linked data represents a globally distributed dataspace which can be queried using the SPARQL query language. However…
Expand
2008
2008
Fast Planning by Search in Domain Transition Graph
Yixin Chen
,
Ruoyun Huang
,
Weixiong Zhang
AAAI Conference on Artificial Intelligence
2008
Corpus ID: 10506315
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on…
Expand
1999
1999
A Petri nets based object oriented tool for the scheduling of stochastic flexible manufacturing systems
A. Gambin
,
M. A. Piera
,
D. Riera
7th IEEE International Conference on Emerging…
1999
Corpus ID: 53735492
Flexible manufacturing systems (FMS) have been taking a prominent place in production markets, but constant changes in production…
Expand
1998
1998
Fire and biodiversity: studies of vegetation and arthropods
S. Hermann
,
T. V. Hook
,
R. Flowers
1998
Corpus ID: 13996958
Fire is a critical management tool in natural and mature old-field pineuplands of the Coastal Plain in the southeastern United…
Expand
1996
1996
Structural adaptation in mixture of experts
V. Ramamurti
,
Joydeep Ghosh
Proceedings of 13th International Conference on…
1996
Corpus ID: 14245433
The "mixture of experts" framework provides a modular and flexible approach to function approximation. However, the important…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE