93 search results - page 11 / 19 » Computational Complexity in Non-Turing Models of Computation... |
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— In this paper we demonstrate how one can reformulate the MPC problem for LPV systems to a series of mpLPs by a closed-loop minimax MPC algorithm based on dynamic progra...
COMPUTER
1998
13 years 8 months ago
1998
provide tools or abstractions that allow developers to program in parallel. But what hardware do we need to support shared memory threads? The hardware should provide a well-defin...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
CHI
2011
ACM
13 years 17 days ago
2011
ACM
People with chronic health problems use online resources to understand and manage their condition, but many such resources can present competing and confusing viewpoints. We surve...
MAGS
2008
13 years 9 months ago
2008
The GRID and MAS (Multi-Agent Systems) communities believe in the potential of GRID and MAS to enhance each other as these models have developed significant complementarities. Thu...