Sciweavers

4926 search results - page 349 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 4 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
IJWMC
2010
115views more  IJWMC 2010»
15 years 2 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
127
Voted
MTA
2006
115views more  MTA 2006»
15 years 4 months ago
Cache modeling and optimization for portable devices running MPEG-4 video decoder
Abstract There are increasing demands on portable communication devices to run multimedia applications. ISO (an International Organization for Standardization) standard MPEG-4 is a...
Abu Asaduzzaman, Imad Mahgoub
ALGOSENSORS
2009
Springer
15 years 8 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
STAIRS
2008
143views Education» more  STAIRS 2008»
15 years 6 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek