Sciweavers

5793 search results - page 244 / 1159
» Individual communication complexity
Sort
View
FCCM
2005
IEEE
107views VLSI» more  FCCM 2005»
16 years 7 days ago
Simplifying the Integration of Processing Elements in Computing Systems Using a Programmable Controller
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...
Lesley Shannon, Paul Chow
IACR
2011
127views more  IACR 2011»
14 years 6 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
IATA
1998
Springer
15 years 11 months ago
A Dynamic Hierarchy of Intelligent Agents for Network Management
Routing as well as the management of communicationnetworks that support hybrid types of communications requiring quality of service is a very hard problem. We present here a frame...
Christian Frei, Boi Faltings
157
Voted
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
SPLC
2008
15 years 8 months ago
Do SAT Solvers Make Good Configurators?
A configuration process is about finding a configuration, a setting, that satisfies the requirements given by the user and constraints imposed by the domain. Feature models are us...
Mikolás Janota