3820 search results - page 512 / 764 » Bounded Model Debugging |
131
click to vote
AIEDAM
2008
15 years 3 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
AUTOMATICA
2008
15 years 3 months ago
2008
This paper is concerned with the problem of robust filtering for uncertain linear discrete-time descriptor systems. The matrices of the system state-space model are uncertain, bel...
119
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
123
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
108
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We define the "Pulse Synchronization" problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing syste...