Sciweavers

3958 search results - page 232 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
IJCNN
2006
IEEE
16 years 19 days ago
A Comparison between Recursive Neural Networks and Graph Neural Networks
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
Vincenzo Di Massa, Gabriele Monfardini, Lorenzo Sa...
ICPADS
1998
IEEE
15 years 11 months ago
Symbolic Partitioning and Scheduling of Parameterized Task Graphs
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
CASES
2010
ACM
15 years 4 months ago
Fine-grain dynamic instruction placement for L0 scratch-pad memory
We present a fine-grain dynamic instruction placement algorithm for small L0 scratch-pad memories (spms), whose unit of transfer can be an individual instruction. Our algorithm ca...
JongSoo Park, James D. Balfour, William J. Dally
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
16 years 1 months ago
Distributed, dynamic, and autonomous reconfiguration planning for chain-type self-reconfigurable robots
— This paper presents a dynamic and distributed reconfiguration planning algorithm for chain-type selfreconfigurable robots, by which a robot can autonomously self-reconfigure fr...
Feili Hou, Wei-Min Shen
LATIN
1998
Springer
15 years 10 months ago
Dynamic Packet Routing on Arrays with Bounded Buffers
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
Andrei Z. Broder, Alan M. Frieze, Eli Upfal