Sciweavers

135 search results - page 18 / 27
» Bounded Synthesis
Sort
View
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 11 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
FORMATS
2010
Springer
13 years 5 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
28
Voted
AUTOMATICA
2005
126views more  AUTOMATICA 2005»
13 years 7 months ago
Relations between uncertainty structures in identification for robust control
Various techniques of system identification exist that provide a nominal model and an uncertainty bound. An important question is what the implications are for the particular choi...
Sippe G. Douma, Paul M. J. Van den Hof
FSTTCS
2010
Springer
13 years 5 months ago
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICIP
2009
IEEE
13 years 5 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré