Sciweavers

4719 search results - page 867 / 944
» Newtonian program analysis
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 18 days ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
93
Voted
ACL
2006
15 years 14 days ago
Re-Usable Tools for Precision Machine Translation
The LOGON MT demonstrator assembles independently valuable general-purpose NLP components into a machine translation pipeline that capitalizes on output quality. The demonstrator ...
Jan Tore Lønning, Stephan Oepen
IJCAI
1989
15 years 7 days ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 4 days ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
ISSTA
2010
ACM
14 years 11 months ago
Automatically identifying critical input regions and code in applications
Applications that process complex inputs often react in different ways to changes in different regions of the input. Small changes to forgiving regions induce correspondingly smal...
Michael Carbin, Martin C. Rinard