In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
This work analyses two heuristic algorithms based on the genetic evolution theory applied to direct sequence code division multiple access (DS/CDMA) communication systems. For diff...
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...