Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,681,816 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
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
2009
2009
Collection depots facility location problems in trees
R. Benkoczi
,
B. Bhattacharya
,
A. Tamir
Networks
2009
Corpus ID: 6589582
We consider a generalization of the median and center facility location problem called the collection depots facility location…
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 genetic programming approach to logic function synthesis by means of multiplexers
A. H. Aguirre
,
B. Buckles
,
C. C. Coello
Proceedings of the First NASA/DoD Workshop on…
1999
Corpus ID: 17207871
This paper presents an approach based on the use of genetic programming to synthesize logic functions. The proposed approach uses…
Expand
1997
1997
An e cient algorithm for temporal abduction
V. Brusoni
,
L. Console
,
P. Terenziani
,
D. T. Dupr
1997
Corpus ID: 14300023
In this paper, we consider the following form of temporal abduction: given a domain theory where each explanatory formula is…
Expand
1984
1984
Prune belly syndromeを伴った臍帯ヘルニアの1女児例
藤木 三喜夫
,
勝三 辻
,
嘉也 堀川
,
隆三 横山
,
暁 大田
1984
Corpus ID: 82236635
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