Sciweavers

1730 search results - page 166 / 346
» Algebra and Computation
Sort
View
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
15 years 2 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
AHS
2007
IEEE
262views Hardware» more  AHS 2007»
15 years 5 months ago
A Reed-Solomon Algorithm for FPGA Area Optimization in Space Applications
This work describes an algebraic based design strategy targeting area optimization in reconfigurable computer technology (FPGA). Area optimization is a major issue as smaller comp...
Gabriel Marchesan Almeida, Eduardo Augusto Bezerra...
112
Voted
CONCUR
2008
Springer
15 years 5 months ago
Termination Problems in Chemical Kinetics
We consider nondeterministic and probabilistic termination problems in a process algebra that is equivalent to basic chemistry. We show that the existence of a terminating computat...
Gianluigi Zavattaro, Luca Cardelli
111
Voted
SOFSEM
2009
Springer
16 years 24 days ago
Epistemic Strategies and Games on Concurrent Processes
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
Konstantinos Chatzikokolakis, Sophia Knight, Praka...
124
Voted
ICS
1997
Tsinghua U.
15 years 8 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali