Sciweavers

2335 search results - page 290 / 467
» Functional Differentiation of Computer Programs
Sort
View
123
Voted
ASM
2004
ASM
15 years 8 months ago
Intra-step Interaction
For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the ...
Yuri Gurevich
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
15 years 26 days ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 6 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
136
Voted
TLCA
2009
Springer
15 years 9 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
99
Voted
IDA
2007
Springer
15 years 8 months ago
Learning to Align: A Statistical Approach
We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the p...
Elisa Ricci, Tijl De Bie, Nello Cristianini