Sciweavers

861 search results - page 146 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
CIMCA
2005
IEEE
14 years 1 months ago
Applying a Web-Service-Based Model to Dynamic Service-Deployment
Owing to the increase in both heterogeneity and complexity in today’s networking systems, the need arises for an architecture for network-based services that provides flexibilit...
Christos Chrysoulas, Evangelos Haleplidis, Robert ...
CP
2009
Springer
14 years 8 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
ICC
2007
IEEE
14 years 1 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
ECBS
2010
IEEE
209views Hardware» more  ECBS 2010»
13 years 12 months ago
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking
The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pr...
Lucas Cordeiro, Bernd Fischer 0002, João Ma...
CASES
2006
ACM
13 years 11 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu