Sciweavers

2947 search results - page 453 / 590
» Analyzing Program Analyses
Sort
View
JGAA
2000
85views more  JGAA 2000»
14 years 11 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
MP
2007
100views more  MP 2007»
14 years 11 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni
PC
2007
147views Management» more  PC 2007»
14 years 10 months ago
Thread-safety in an MPI implementation: Requirements and analysis
The MPI-2 Standard has carefully specified the interaction between MPI and usercreated threads. The goal of this specification is to allow users to write multithreaded MPI progr...
William Gropp, Rajeev Thakur
AMC
2008
206views more  AMC 2008»
14 years 10 months ago
Global-best harmony search
ct 8 Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where 9 musicians improvise their instruments' pitches searching...
Mahamed G. H. Omran, Mehrdad Mahdavi
MP
2010
135views more  MP 2010»
14 years 9 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal