4117 search results - page 599 / 824 » On the Satisfiability of Complex Constraints |
228
click to vote
FOSSACS
2001
Springer
15 years 11 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
161
click to vote
RE
2001
Springer
15 years 11 months ago
2001
Springer
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
187
click to vote
VISUALIZATION
1994
IEEE
15 years 10 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
170
click to vote
ECBS
2009
IEEE
15 years 10 months ago
2009
IEEE
Future space missions such as the Mars Science Laboratory and Project Constellation suggest the engineering of some of the most complex man-rated software systems. The present pro...
187
click to vote
BROADNETS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a joint PHY/MAC architecture (DCC-MAC) for 802.15.4a-like networks based on PPM-UWB. Unlike traditional approaches it fully utilizes the specific nature of UWB to achie...