Sciweavers

5180 search results - page 338 / 1036
» Concurrency, Time, and Constraints
Sort
View
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
SRDS
1997
IEEE
15 years 11 months ago
Availability Analysis of Transaction Processing Systems based on User-Perceived Performance
Transaction processing systems are judged by users to be correctly functioning not only if their transactions are executed correctly, but also if most of them are completed within...
Varsha Mainkar
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 11 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
HICSS
2006
IEEE
126views Biometrics» more  HICSS 2006»
16 years 26 days ago
A Model for Temporal Interval Authorizations
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with subjects and...
Francis B. Afinidad, Timothy E. Levin, Cynthia E. ...
185
Voted
VLSID
2004
IEEE
119views VLSI» more  VLSID 2004»
16 years 7 months ago
Rapid Prototyping for Configurable System-on-a-Chip Platforms: A Simulation Based Approach
The design of any application on a configurable System-on-a-Chip (SoC) like Atmel's FPSLIC is subject to a lot of constraints stemming from requirements of the application an...
Jens Bieger, Sorin A. Huss, Michael Jung, Stephan ...