Sciweavers

13457 search results - page 110 / 2692
» Can we elect if we cannot compare
Sort
View
APNOMS
2009
Springer
14 years 3 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
CDC
2010
IEEE
115views Control Systems» more  CDC 2010»
13 years 4 months ago
Distributed statistical estimation of the number of nodes in sensor networks
The distributed estimation of the number of active sensors in a network can be important for estimation and organization purposes. We propose a design methodology based on the foll...
Damiano Varagnolo, Gianluigi Pillonetto, Luca Sche...
HIS
2007
13 years 10 months ago
Genetic Programming meets Model-Driven Development
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...
Thomas Weise, Michael Zapf, Mohammad Ullah Khan, K...
BMCBI
2005
112views more  BMCBI 2005»
13 years 9 months ago
Vector analysis as a fast and easy method to compare gene expression responses between different experimental backgrounds
Background: Gene expression studies increasingly compare expression responses between different experimental backgrounds (genetic, physiological, or phylogenetic). By focusing on ...
Rainer Breitling, Patrick Armengaud, Anna Amtmann
BPM
2006
Springer
113views Business» more  BPM 2006»
14 years 23 days ago
Process Equivalence: Comparing Two Process Models Based on Observed Behavior
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service match...
Wil M. P. van der Aalst, Ana Karla A. de Medeiros,...