Sciweavers

4074 search results - page 75 / 815
» Defining Computational Aesthetics
Sort
View
UAI
2004
13 years 9 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
TOPLAS
2008
78views more  TOPLAS 2008»
13 years 7 months ago
The pitfalls of verifying floating-point computations
Current critical systems often use a lot of floating-point computations, and thus the testing or static analysis of programs containing floatingpoint operators has become a priori...
David Monniaux
ICALP
2010
Springer
13 years 5 months ago
Rewriting Measurement-Based Quantum Computations with Generalised Flow
Abstract. We present a method for verifying measurement-based quantum computations, by producing a quantum circuit equivalent to a given deterministic measurement pattern. We defin...
Ross Duncan, Simon Perdrix
ICMS
2010
13 years 5 months ago
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
Bettina Eick, Max Horn
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 5 months ago
Infinite Time Cellular Automata: A Real Computation Model
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
Fabien Givors, Grégory Lafitte, Nicolas Oll...