4117 search results - page 494 / 824 » On the Satisfiability of Complex Constraints |
200
click to vote
AUTOMATICA
2011
15 years 1 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
179
click to vote
JMLR
2010
15 years 1 months ago
2010
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
194
click to vote
TWC
2010
15 years 1 months ago
2010
This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interferenceplus-noise rat...
206
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
124
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— Nanoscale technologies provide both challenges and opportunities. We show that the issues and potential solutions facing designers are technology independent and arise mainly f...