Sciweavers

530 search results - page 12 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 3 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
VISUALIZATION
2005
IEEE
14 years 2 months ago
The Value of Visualization
The field of Visualization is getting mature. Many problems have been solved, and new directions are sought for. In order to make good choices, an understanding of the purpose an...
Jarke J. van Wijk
TSP
2010
13 years 3 months ago
A new parametric GLRT for multichannel adaptive signal detection
A parametric generalized likelihood ratio test (GLRT) for multichannel signal detection in spatially and temporally colored disturbance was recently introduced by modeling the dist...
Pu Wang, Hongbin Li, Braham Himed
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 7 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
CP
2005
Springer
14 years 2 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen