default search action
Studia Informatica Universalis, Volume 6
Volume 6, Number 1, 2008
- Jean Frédéric Myoupo, Idrissa Sow:
Clustering in Mobile Ad Hoc Networks With Some Nodes Having the Same Weight. 1-13 - Clément Saad, Abderrahim Benslimane, Jean-Claude König:
AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks. 14-39 - Fabrice Theoleyre, Fabrice Valois:
VSR: A Routing Protocol based on a Structure of Self-Organization. 40-69 - Soufian Ben Amor:
Stochastic Optimization of Manets. 70-87
Volume 6, Number 2, 2008
- Spyros Voulgaris, Maarten van Steen, Aline Baggio, Gerco Ballintijn:
Transparent Data Relocation in Highly Available Distributed Systems. 88-109 - Emmanuelle Anceaume, Eric Mourgaya, Philippe Raipin Parvédy:
Unreliable Distributed Timing Scrutinizer to Converge toward Decision Conditions. 110-136 - Boris Koldehofe:
Simple gossiping with balls and bins. 137-168 - Stéphane Vialle, Guillaume Schaeffer, Michel Ianotto:
Design of a Multi-Strategy Parallelization for an Entire Application of Document Categorization on Low-Cost Multiprocessor PCs. 169-195 - Tommaso Bolognesi:
Predicates for state changes vs. processes for event patterns. 196-235
Volume 6, Number 3, 2008
- Mihaela Butaru, Zineb Habbas:
The Phase Transition Behaviour of Non-binary Forward Checking Algorithms. 236-260 - Do Xuan Duong, Pham Huy Dien:
Solving the Lecture Scheduling Problem by the Combination of Exchange Procedure and Tabu Search Techniques. 261-273 - Michaël Krajecki, Christophe Jaillet, Alain Bui:
Parallel Tree Search for Combinatorial Problems: a Comparative Study between OpenMP and MPI, . 274-312 - Jalel Ben-Othman, Hind Castel-Taleb, Lynda Mokdad:
Performance Evaluation of Mobile Networks Based on Stochastic Ordering Markov Chains. 313-329
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.