738 search results - page 140 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
105
click to vote
ICDCS
2011
IEEE
13 years 9 months ago
2011
IEEE
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
105
Voted
EMSOFT
2003
Springer
15 years 2 months ago
2003
Springer
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
SMA
1999
ACM
15 years 1 months ago
1999
ACM
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...