Sciweavers

306 search results - page 16 / 62
» Underspecified computation of normal forms
Sort
View
CSJM
2006
81views more  CSJM 2006»
13 years 7 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
SYNTHESE
2008
88views more  SYNTHESE 2008»
13 years 7 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
DEBS
2003
ACM
14 years 24 days ago
Looking into the past: enhancing mobile publish/subscribe middleware
Publish/subscribe (pub/sub) middleware facilitates loosely coupled cooperation and fits well the needs of spontaneous, ad-hoc interaction. However, newly started mobile applicati...
Mariano Cilia, Ludger Fiege, C. Haul, Andreas Zeid...
CAV
2008
Springer
115views Hardware» more  CAV 2008»
13 years 9 months ago
An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexi...
Oliver Wienand, Markus Wedler, Dominik Stoffel, Wo...
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 7 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis