Sciweavers

3267 search results - page 333 / 654
» Generalized quasirandom graphs
Sort
View
209
Voted
ICALT
2006
IEEE
16 years 24 days ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
16 years 24 days ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
ACSD
2005
IEEE
90views Hardware» more  ACSD 2005»
16 years 12 days ago
Improved Decomposition of STGs
Signal Transition Graphs (STGs) are a version of Petri nets for the specification of asynchronous circuit behaviour. It has been suggested to decompose such a specification as a...
Walter Vogler, Ben Kangsah
SPAA
2005
ACM
16 years 9 days ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
ATAL
2005
Springer
16 years 9 days ago
Data storage in unreliable multi-agent networks
The distributed data storage on unreliable devices, connected by a short-range radio network is analyzed. Failing devices incur loss of data. To prevent the loss, the data is spli...
Filip Miletic, Patrick Dewilde