Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,481,406 papers from all fields of science
Search
Sign In
Create Free Account
Global optimization
Known as:
Global minimization
, Global optimisation
, Local minimization
Global optimization is a branch of applied mathematics and numerical analysis that deals with the global optimization of a function or a set of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AIMMS
AMPL
Algorithm
Ancestral reconstruction
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Evolutionary coalitional games: design and challenges in wireless networks
M. A. Khan
,
H. Tembine
,
A. Vasilakos
IEEE wireless communications
2012
Corpus ID: 10167942
The current state of the art of evolutionary coalitional game theory in wireless networking and communications is captured in…
Expand
Highly Cited
2007
Highly Cited
2007
SYNTHESIS OF THINNED LINEAR ANTENNA ARRAYS WITH FIXED SIDELOBE LEVEL USING REAL-CODED GENETIC ALGORITHM
G. K. Mahanti
,
N. Pathak
,
P. Mahanti
2007
Corpus ID: 55676634
In this paper, we propose an optimization method based on real-coded genetic algorithm (GA) with elitist strategy for thinning a…
Expand
Highly Cited
2004
Highly Cited
2004
AN ELECTROMAGNETISM ALGORITHM OF NEURAL NETWORK ANALYSIS—AN APPLICATION TO TEXTILE RETAIL OPERATION
Peitsang Wu
,
Wen-Hung Yang
,
N. Wei
2004
Corpus ID: 15964606
ABSTRACT This paper applies a heuristic algorithm, called the “Electromagnetism Algorithm” (EM) [3], for neural network training…
Expand
Highly Cited
2003
Highly Cited
2003
Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System
Wen-Chih Peng
,
Ming-Syan Chen
IEEE Transactions on Knowledge and Data…
2003
Corpus ID: 15613818
In this paper, we present a new data mining algorithm which involves incremental mining for user moving patterns in a mobile…
Expand
Highly Cited
2003
Highly Cited
2003
Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum
Pablo A. Anigstein
,
V. Anantharam
IEEE Transactions on Information Theory
2003
Corpus ID: 14063466
Viswanath and Anantharam (1999) characterize the sum capacity of multiaccess vector channels. For a given number of users…
Expand
Highly Cited
2002
Highly Cited
2002
Test power reduction through minimization of scan chain transitions
O. Sinanoglu
,
I. Bayraktaroglu
,
A. Orailoglu
Proceedings 20th IEEE VLSI Test Symposium (VTS )
2002
Corpus ID: 7131991
Parallel test application helps reduce the otherwise considerable test times in SOCs; yet its applicability is limited by average…
Expand
Highly Cited
2000
Highly Cited
2000
Approximately optimal assignment for unequal loss protection
A. Mohr
,
Richard E. Ladner
,
E. Riskin
Proceedings International Conference on Image…
2000
Corpus ID: 1671374
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive…
Expand
Highly Cited
2000
Highly Cited
2000
A robust method to obtain optimal and sub-optimal design and retrofit solutions of water utilization systems with multiple contaminants in process plants
M. Bagajewicz
,
M. Rivas
,
M. Savelski
2000
Corpus ID: 19406946
Highly Cited
1992
Highly Cited
1992
An algorithm for the mixed-integer nonlinear bilevel programming problem
T. Edmunds
,
J. Bard
Annals of Operations Research
1992
Corpus ID: 21704475
The bilevel programming problem (BLPP) is a two-person nonzero sum game in which play is sequential and cooperation is not…
Expand
Highly Cited
1988
Highly Cited
1988
Kinds of Seeing and Their Functions in Designing
D. Schon
1988
Corpus ID: 196031674
Architectural designing is described as a kind of experimentation that consists in reflective 'conversation' with the materials…
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
or Only Accept Required