1893 search results - page 314 / 379 » Computational composites |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
EWSN
2008
Springer
14 years 7 months ago
2008
Springer
Component-based architectures are the traditional approach cile application specific optimization with reusable abstractions in sensor networks. However, they frequently overwhelm ...
ICWS
2009
IEEE
14 years 5 months ago
2009
IEEE
Negotiation of Service Level Agreements (SLAs) is very important for maintaining Quality of Service (QoS) of composite Web services-based business processes. The process of negoti...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation between processes has been proven a successful method for formalizing security properties. We argue that in certain cases, a scheduler that has full information on the...