Sciweavers

8699 search results - page 223 / 1740
» Elements of the Theory of Computation
Sort
View
PARA
2004
Springer
15 years 12 months ago
Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...
Paolo Bientinesi, Sergey Kolos, Robert A. van de G...
CHI
2008
ACM
15 years 7 months ago
Secrets and lies in computer-mediated interaction: theory, methods and design
The keeping of secrets and practicing of deception are commonplace in everyday social interaction. They also serve an important role in encouraging social cohesion. However, for H...
Adam N. Joinson, Jeffrey T. Hancock, Pamela Briggs
MP
2006
110views more  MP 2006»
15 years 6 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
15 years 6 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl