Sciweavers

466 search results - page 21 / 94
» Fundamental Complexity of Optical Systems
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
COMPSAC
2002
IEEE
14 years 2 months ago
Application of Hazard Analysis to Software Quality Modelling
Quality is a fundamental concept in software and information system development. It is also a complex and elusive concept. A large number of quality models have been developed for...
Hong Zhu, Yanlong Zhang, Qingning Huo, Sue Greenwo...
DATE
2010
IEEE
192views Hardware» more  DATE 2010»
14 years 2 months ago
PhoenixSim: A simulator for physical-layer analysis of chip-scale photonic interconnection networks
—Recent developments have shown the possibility of leveraging silicon nanophotonic technologies for chip-scale interconnection fabrics that deliver high bandwidth and power effi...
Johnnie Chan, Gilbert Hendry, Aleksandr Biberman, ...
PODC
2005
ACM
14 years 2 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
PODC
2006
ACM
14 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer