Sciweavers

4131 search results - page 188 / 827
» Compactness in Topology and Computation
Sort
View
DAC
2005
ACM
16 years 7 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
CCA
2009
Springer
16 years 1 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
BROADNETS
2006
IEEE
16 years 16 days ago
Design and Dimensioning of a Novel composite-star WDM Network with TDM Channel Partitioning
— This paper presents the design and dimensioning optimization of a novel optical network structure, called the Petaweb, having a total capacity of several Pb/s (1015 bit/s). Its...
Stefano Secci, Brunilde Sansò
ASAP
2003
IEEE
108views Hardware» more  ASAP 2003»
15 years 11 months ago
Physical Planning for On-Chip Multiprocessor Networks and Switch Fabrics
On-chip implementation of multiprocessor systems requires the planarization of the interconnect network onto the silicon floorplan. Manual floorplanning approaches will become i...
Terry Tao Ye, Giovanni De Micheli
SP
2002
IEEE
147views Security Privacy» more  SP 2002»
15 years 6 months ago
CX: A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks...
Peter R. Cappello, Dimitros Mourloukos