3868 search results - page 449 / 774 » Open Systems in TLA |
197
click to vote
CSL
2007
Springer
16 years 27 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
147
Voted
FPL
2007
Springer
16 years 27 days ago
2007
Springer
The new breed of reconfigurable integrated circuits (ICs) offer switched-capacitor based analogue circuits whose functionality can be altered during run-time. Rapidly changing th...
205
click to vote
ICN
2007
Springer
16 years 26 days ago
2007
Springer
Current market research indicates high future demand for broadcast services such as Mobile TV. While underlying competing bearer technologies are being extensively tested and refi...
186
click to vote
ISSAC
2007
Springer
16 years 26 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
187
click to vote
IWSM
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Non-functional requirements (NFRs) of software systems are an important source of uncertainty in effort estimation. Furthermore, quantitatively approaching NFR early in a...