Sciweavers

29908 search results - page 5842 / 5982
» On the complexity of communication complexity
Sort
View
JSYML
2007
100views more  JSYML 2007»
15 years 6 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
TVLSI
2008
105views more  TVLSI 2008»
15 years 6 months ago
Robust Concurrent Online Testing of Network-on-Chip-Based SoCs
Lifetime concerns for complex systems-on-a-chip (SoC) designs due to decreasing levels in reliability motivate the development of solutions to ensure reliable operation. A precurso...
Praveen Bhojwani, Rabi N. Mahapatra
TVLSI
2008
187views more  TVLSI 2008»
15 years 6 months ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...
JUCS
2007
95views more  JUCS 2007»
15 years 6 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
JUCS
2007
93views more  JUCS 2007»
15 years 6 months ago
Quality of Service Routing in a MANET with OLSR
: Ad hoc wireless networks have enormous commercial and military potential because of their self-organizing capacity and mobility support. However, some specificities of these net...
Dang-Quan Nguyen, Pascale Minet
« Prev « First page 5842 / 5982 Last » Next »