8196 search results - page 442 / 1640 » Computational Modeling and Complexity Science |
183
click to vote
SOFSEM
2007
Springer
16 years 29 days ago
2007
Springer
We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator d...
186
click to vote
SOFSEM
2007
Springer
16 years 29 days ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
162
click to vote
WG
2007
Springer
16 years 29 days ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
165
click to vote
ACMSE
2006
ACM
16 years 25 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
170
click to vote
ACSC
2005
IEEE
16 years 14 days ago
2005
IEEE
The Self-Organizing Map (SOM) is one of the popular Artificial Neural Networks which is a useful in clustering and visualizing complex high dimensional data. Conventional SOMs are...