Sciweavers

6045 search results - page 2 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TCS
2011
13 years 5 days ago
Musings around the geometry of interaction, and coherence
We introduce the Danos-Régnier category
Jean Goubault-Larrecq
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
13 years 9 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...
CIE
2007
Springer
13 years 11 months ago
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
Geometrical Computation and the Linear Blum, Shub and Smale Model Geometrical Computation and the Linear Blum, Shub and Smale Model J´erˆome Durand-Lose Laboratoire d’Informati...
Jérôme Durand-Lose
CDC
2009
IEEE
196views Control Systems» more  CDC 2009»
13 years 3 months ago
A computational stability analysis of discrete-time piecewise linear systems
A computational method for stability analysis of discrete-time piecewise linear systems is presented. The method is based on combining the solutions to two separate problems: one i...
Satyajit Arivukkodi Krishnamurthy, Ji-Woong Lee
WOLLIC
2007
Springer
13 years 11 months ago
Computational Interpretations of Classical Linear Logic
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
Paulo Oliva