Sciweavers

383 search results - page 40 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
GECCO
2010
Springer
218views Optimization» more  GECCO 2010»
14 years 24 days ago
Cartesian genetic programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
Julian Francis Miller, Simon L. Harding
BIRTHDAY
1994
Springer
14 years 27 days ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
POPL
2011
ACM
12 years 11 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 26 days ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
NIPS
2004
13 years 10 months ago
A Cost-Shaping LP for Bellman Error Minimization with Performance Guarantees
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
Daniela Pucci de Farias, Benjamin Van Roy