Sciweavers

4075 search results - page 231 / 815
» Modeling Distributed Algorithm Using B
Sort
View
AINA
2009
IEEE
15 years 4 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
SPAA
1997
ACM
15 years 10 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
HPCC
2007
Springer
15 years 10 months ago
A New Method for Multi-objective TDMA Scheduling in Wireless Sensor Networks Using Pareto-Based PSO and Fuzzy Comprehensive Judg
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
Tao Wang, Zhiming Wu, Jianlin Mao
FPGA
2006
ACM
224views FPGA» more  FPGA 2006»
15 years 10 months ago
Flexible implementation of genetic algorithms on FPGAs
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shiba...
MOBICOM
2012
ACM
13 years 9 months ago
FLIGHT: clock calibration using fluorescent lighting
In this paper, we propose a novel clock calibration approach called FLIGHT, which leverages the fact that the fluorescent light intensity changes with a stable period that equals...
Zhenjiang Li, Wenwei Chen, Cheng Li, Mo Li, Xiang-...