Sciweavers

5793 search results - page 776 / 1159
» Individual communication complexity
Sort
View
IJCAI
2007
15 years 8 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
169
Voted
SEC
2008
15 years 8 months ago
Collaborative architecture for malware detection and analysis
The constant increase of malware threats clearly shows that the present countermeasures are not sufficient especially because most actions are put in place only when infections hav...
Michele Colajanni, Daniele Gozzi, Mirco Marchetti
170
Voted
SIROCCO
2008
15 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
CASCON
2001
92views Education» more  CASCON 2001»
15 years 8 months ago
Extending the message flow debugger for MQSI
Integration and management of applications play key roles in today's computing. MQSeries is an asynchronous, assured application-to-application communication protocol designe...
Shuxia Tan, Eshrat Arjomandi, Richard F. Paige, Ev...
162
Voted
PICS
2001
15 years 8 months ago
An Autosophy Image Content-Based Television System
A first television system based on the Autosophy information theory is now being tested. The new television marks a major theoretical break from conventional television based on t...
Klaus Holtz, Eric Holtz