Sciweavers

1743 search results - page 272 / 349
» Generalized Modal Satisfiability
Sort
View
142
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 12 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
117
Voted
IANDC
2010
115views more  IANDC 2010»
14 years 12 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
CDC
2010
IEEE
140views Control Systems» more  CDC 2010»
14 years 9 months ago
On the observability of linear systems from random, compressive measurements
Abstract-- Recovering or estimating the initial state of a highdimensional system can require a potentially large number of measurements. In this paper, we explain how this burden ...
Michael B. Wakin, Borhan Molazem Sanandaji, Tyrone...
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 9 months ago
Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
Siva K. Gorantla, Todd P. Coleman
EWC
2011
52views more  EWC 2011»
14 years 9 months ago
Localized coarsening of conforming all-hexahedral meshes
Abstract. Finite element mesh adaptation methods can be used to improve the efficiency and accuracy of solutions to computational modeling problems. In many applications involving ...
Adam C. Woodbury, Jason F. Shepherd, Matthew L. St...