Sciweavers

2526 search results - page 182 / 506
» A Comparative Evaluation of Name-Matching Algorithms
Sort
View
ADHOC
2007
108views more  ADHOC 2007»
13 years 9 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici
IJISTA
2008
95views more  IJISTA 2008»
13 years 9 months ago
Mining manufacturing data using genetic algorithm-based feature set decomposition
Data mining methods can be used for discovering interesting patterns in manufacturing databases. These patterns can be used to improve manufacturing processes. However, data accum...
Lior Rokach
CCGRID
2008
IEEE
14 years 3 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...
SCAI
2008
13 years 10 months ago
Troubleshooting when Action Costs are Dependent with Application to a Truck Engine
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
Håkan Warnquist, Mattias Nyberg, Petter S&au...
MOBIHOC
2004
ACM
14 years 9 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li