Sciweavers

5065 search results - page 776 / 1013
» Neural networks: Algorithms and applications
Sort
View
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 24 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
EMSOFT
2005
Springer
16 years 23 days ago
A GA-based scheduling method for FlexRay systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hi...
SPDP
1993
IEEE
15 years 11 months ago
Fast Rehashing in PRAM Emulations
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
J. Keller
DATE
2004
IEEE
125views Hardware» more  DATE 2004»
15 years 11 months ago
Local Decisions and Triggering Mechanisms for Adaptive Fault-Tolerance
Dynamic fault-tolerance management (DFTM) was previously introduced as a means of providing environmentand workload-driven adaptation for failure-prone battery powered systems. Th...
Phillip Stanley-Marbell, Diana Marculescu
WSCG
2001
89views more  WSCG 2001»
15 years 8 months ago
Searching Triangle Strips Guided by Simplification Criterion
Triangle strips are widely used as a method to accelerate the visualisation process of polygon models in interactive graphics applications. Another widely used method to improve d...
Oscar Belmonte, José Ribelles, Inmaculada R...