Sciweavers

595 search results - page 95 / 119
» Visualizing and Evaluating Complexity of Textual Case Bases
Sort
View
FPGA
2004
ACM
137views FPGA» more  FPGA 2004»
14 years 1 months ago
Making visible the thermal behaviour of embedded microprocessors on FPGAs: a progress report
This paper shows a method to verifying the thermal status of complex FPGA-based circuits like microprocessors. Thus, the designer can evaluate if a particular block is working bey...
Sergio López-Buedo, Eduardo I. Boemo
IWCMC
2010
ACM
13 years 7 months ago
Policy-driven workflows for mobile network management automation
Future wireless networks will experience a continuous growth regarding the number of network elements with increasingly complex interrelations between the configuration of multipl...
Raphael Romeikat, Bernhard Bauer, Tobias Bandh, Ge...
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
ISPDC
2008
IEEE
14 years 2 months ago
Performance Analysis of Grid DAG Scheduling Algorithms using MONARC Simulation Tool
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
Florin Pop, Ciprian Dobre, Valentin Cristea