Sciweavers

5090 search results - page 215 / 1018
» Constructing Strategies for Programming
Sort
View
128
Voted
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
15 years 3 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 2 months ago
Propositional theories are strongly equivalent to logic programs
In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be re...
Pedro Cabalar, Paolo Ferraris
PR
2007
111views more  PR 2007»
15 years 2 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an opt...
Jean-François Dufourd
GECCO
2009
Springer
164views Optimization» more  GECCO 2009»
15 years 11 days ago
Solving iterated functions using genetic programming
An iterated function f(x) is a function that when composed with itself, produces a given expression f(f(x))=g(x). Iterated functions are essential constructs in fractal theory and...
Michael D. Schmidt, Hod Lipson
IOR
2011
152views more  IOR 2011»
14 years 9 months ago
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
Naomi Miller, Andrzej Ruszczynski