2473 search results - page 87 / 495 » The Logic of Communication Graphs |
CC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
FPL
2000
Springer
13 years 11 months ago
2000
Springer
Following the simple Programmable Logic Device (SPLD) and Field Programmable Gate Array (FPGA) generations a third generation of programmable logic technologies is now reaching the...
ROOM
2000
13 years 9 months ago
2000
In this paper we provide a systematic formal interpretation for most elements of the UML notation. This interpretation, in a structured temporal logic, enables precise analysis of...
SOCO
2007
Springer
14 years 1 months ago
2007
Springer
In component based software engineering, an application is build by composing trusted and reusable units of execution, the components. A composition is formed by connecting the com...
CIA
2004
Springer
14 years 1 months ago
2004
Springer
Given a specification of communication rules in a multiagent system (in the form of protocols, ACL semantics, etc.), the question of how to design appropriate agents that can oper...