Sciweavers

2485 search results - page 84 / 497
» Time Bounded Frequency Computations
Sort
View
141
Voted
SAC
2009
ACM
15 years 11 months ago
Length-lex bound consistency for knapsack constraints
This paper considers the length-lex domain for set-variables in constraint programming which includes not only membership but also cardinality and lexicographic information. The p...
Justin Yip, Pascal Van Hentenryck
FOSSACS
2007
Springer
15 years 10 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
DCC
2010
IEEE
15 years 4 months ago
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...
Kenneth W. Shum, Wing Shing Wong
ECRTS
2009
IEEE
15 years 2 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
VLSID
2003
IEEE
123views VLSI» more  VLSID 2003»
16 years 4 months ago
Synthesis of Real-Time Embedded Software by Timed Quasi-Static Scheduling
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
Pao-Ann Hsiung, Feng-Shi Su