Sciweavers

4839 search results - page 266 / 968
» A survey of computational complexity results in systems and ...
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
CASES
2004
ACM
16 years 1 days ago
Hardware assisted control flow obfuscation for embedded processors
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...
Xiaotong Zhuang, Tao Zhang, Hsien-Hsin S. Lee, San...
HASE
2008
IEEE
15 years 6 months ago
Aiding Modular Design and Verification of Safety-Critical Time-Triggered Systems by Use of Executable Formal Specifications
Designing safety-critical systems is a complex process, and especially when the design is carried out at different f abstraction where the correctness of the design at one level i...
Kohei Sakurai, Péter Bokor, Neeraj Suri
AUTOMOTIVEUI
2009
ACM
16 years 1 months ago
Acceptance of future persuasive in-car interfaces towards a more economic driving behaviour
Measuring user acceptance to avoid system rejection by the users in pre-prototype stage of product development is of high interest for both researchers and practitioners. This is ...
Alexander Meschtscherjakov, David Wilfinger, Thoma...
EICS
2009
ACM
16 years 1 months ago
Fiia: user-centered development of adaptive groupware systems
Adaptive groupware systems support changes in users’ locations, devices, roles and collaborative structure. Developing such systems is difficult due to the complex distributed ...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...