Sciweavers

2192 search results - page 303 / 439
» Algorithms for Challenging Motif Problems
Sort
View
139
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
139
Voted
IPPS
2009
IEEE
15 years 10 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
164
Voted
PODC
2006
ACM
15 years 9 months ago
Self-stabilizing byzantine agreement
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
Ariel Daliot, Danny Dolev
ICCS
2005
Springer
15 years 9 months ago
Self-optimization of Large Scale Wildfire Simulations
The development of efficient parallel algorithms for large scale wildfire simulations is a challenging research problem because the factors that determine wildfire behavior are com...
Jingmei Yang, Huoping Chen, Salim Hariri, Manish P...
129
Voted
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 4 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee