Sciweavers

69 search results - page 9 / 14
» Explaining Algebraic Theory with Functional Programs
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 5 months 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
CP
2006
Springer
13 years 11 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
CCECE
2006
IEEE
14 years 1 months ago
Regularized Fractal Image Decoding
The goal of this paper is to present a new recipe for the fractal image decoding process. In this paper, we explain how fractal-based methods can be internally combined with regul...
Mehran Ebrahimi, Edward R. Vrscay
TPHOL
2000
IEEE
13 years 11 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
AOSD
2012
ACM
12 years 3 months ago
A monadic interpretation of execution levels and exceptions for AOP
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
Nicolas Tabareau