Sciweavers

5065 search results - page 381 / 1013
» Neural networks: Algorithms and applications
Sort
View
JPDC
2006
134views more  JPDC 2006»
15 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
DEXA
1998
Springer
112views Database» more  DEXA 1998»
15 years 11 months ago
Optimisation of Active Rule Agents Using a Genetic Algorithm Approach
Intelligent agents and active databases have a number of common characteristics, the most important of which is that they both execute actions by firing rules upon events occurring...
Evaggelos Nonas, Alexandra Poulovassilis
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
16 years 9 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
PPSN
2004
Springer
16 years 27 days ago
The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling
Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person’s...
Jingpeng Li, Uwe Aickelin
CCR
2008
94views more  CCR 2008»
15 years 7 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...