Sciweavers

752 search results - page 5 / 151
» The standard parts problem and the complexity of control com...
Sort
View
ISQED
2006
IEEE
124views Hardware» more  ISQED 2006»
14 years 1 months ago
DFM Metrics for Standard Cells
Design for Manufacturability (DFM) is becoming increasingly important as process geometries shrink. Conventional design rule pass/fail is not adequate to quantify DFM compliance. ...
Robert C. Aitken
SPAA
2010
ACM
13 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
CN
1999
74views more  CN 1999»
13 years 7 months ago
FIPA-compliant agents for real-time control of Intelligent Network traffic
Autonomy, adaptability, scalability, and flexible communications are all attributes of agents and multi-agent systems which suggest that they may offer timely solutions for dealin...
Brendan Jennings, Rob Brennan, Rune Gustavsson, Ro...
NIME
2001
Springer
126views Music» more  NIME 2001»
14 years 1 days ago
Problems and Prospects for Intimate Musical Control of Computers
In this paper we describe our efforts towards the development of live performance computer-based musical instrumentation. Our design criteria include initial ease of use coupled w...
David Wessel, Matthew Wright
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 25 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
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 ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun