Sciweavers

2877 search results - page 385 / 576
» The Complexity of Planarity Testing
Sort
View
ICSEA
2008
IEEE
15 years 11 months ago
Reuse through Requirements Traceability
The Reuse of code artefacts can make development quicker, cheaper and more robust, but the process is complex and has many pitfalls: Code artefacts must exist, be available, be fo...
Rob Pooley, Craig Warren
ISCAS
2008
IEEE
191views Hardware» more  ISCAS 2008»
15 years 11 months ago
A novel approach for K-best MIMO detection and its VLSI implementation
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
Sudip Mondal, Khaled N. Salama, Wersame H. Ali
NOMS
2008
IEEE
132views Communications» more  NOMS 2008»
15 years 11 months ago
DYSWIS: An architecture for automated diagnosis of networks
As the complexity of networked systems increases, we need mechanisms to automatically detect failures in the network and diagnose the cause of such failures. To realize true self-...
Vishal Kumar Singh, Henning Schulzrinne, Kai Miao
SEAA
2008
IEEE
15 years 11 months ago
GRAIL - A Tool for Accessing and Instrumenting WSRF - compliant Web Services
Grid access methods are still dominated by command line tools or manually developed, problem specific graphical user interfaces. This fact reduces the acceptance of the Grid for ...
Thomas Jejkal, Rainer Stotzka, Michael Sutter
SUTC
2008
IEEE
15 years 11 months ago
Service-Oriented Design Methodology for Wireless Sensor Networks: A View through Case Studies
— In this paper we discuss the design methodology based on the service-oriented architecture and agile development principles for wireless embedded and sensor networks (WSNs). Th...
Elena Meshkova, Janne Riihijärvi, Frank Oldew...