2917 search results - page 242 / 584 » Satisfying Interaction Constraints |
153
click to vote
ACS
2010
15 years 6 months ago
2010
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
165
Voted
QSIC
2005
IEEE
16 years 10 days ago
2005
IEEE
In component software, the independence of components is achieved by separating their interfaces from implementations. The interface definition of a component serves as the contr...
187
click to vote
ENTCS
2010
15 years 6 months ago
2010
An important issue of the service oriented approach is the possibility to aggregate, through programmable coordination patterns, the activities involved by service interactions. T...
189
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
184
Voted
ESORICS
2009
Springer
16 years 7 months ago
2009
Springer
In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new parad...