Sciweavers

112 search results - page 5 / 23
» Components of the Fundamental Category II
Sort
View
82
Voted
MOBIHOC
2001
ACM
15 years 9 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
70
Voted
ICC
2007
IEEE
179views Communications» more  ICC 2007»
15 years 3 months ago
An Improved Vehicular Ad Hoc Routing Protocol for City Environments
—The fundamental component for the success of VANET (Vehicular Ad hoc NETworks) applications is routing since it must efficiently handle rapid topology changes and a fragmented n...
Moez Jerbi, Sidi-Mohammed Senouci, Rabah Meraihi, ...
COORDINATION
2004
Springer
15 years 2 months ago
On Calculi for Context-Aware Coordination
Abstract. Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multiagent sys...
Pietro Braione, Gian Pietro Picco
104
Voted
SCP
2008
150views more  SCP 2008»
14 years 9 months ago
Google's MapReduce programming model - Revisited
Google's MapReduce programming model serves for processing large data sets in a massively parallel manner. We deliver the first rigorous description of the model including it...
Ralf Lämmel
KBSE
2007
IEEE
15 years 3 months ago
Test suite reduction and prioritization with call trees
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
Adam M. Smith, Joshua Geiger, Gregory M. Kapfhamme...