Sciweavers

540 search results - page 90 / 108
» Mathematical programming based debugging
Sort
View
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 25 days ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
LICS
2002
IEEE
14 years 9 days ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
JILP
2000
103views more  JILP 2000»
13 years 7 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
JOTA
2011
78views more  JOTA 2011»
12 years 10 months ago
Outer Trust-Region Method for Constrained Optimization
Given an algorithm A for solving some mathematical problem based on the iterative solution of simpler subproblems, an Outer Trust-Region (OTR) modification of A is the result of ...
Ernesto G. Birgin, Emerson V. Castelani, Andr&eacu...
PLDI
2005
ACM
14 years 28 days ago
Formal loop merging for signal transforms
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
Franz Franchetti, Yevgen Voronenko, Markus Pü...