9818 search results - page 1712 / 1964 » Much Support and More |
207
click to vote
COCO
2003
Springer
16 years 19 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
212
click to vote
ICWE
2003
Springer
16 years 18 days ago
2003
Springer
This work presents a research on the methods and mechanisms necessary to bring the Information and Communication Technologies in the traditional classroom. This will be achieved by...
232
click to vote
ACSC
2002
IEEE
16 years 11 days ago
2002
IEEE
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
218
click to vote
FOCS
2002
IEEE
16 years 11 days ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
227
click to vote
STOC
2010
ACM
16 years 8 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...