Sciweavers

24421 search results - page 4869 / 4885
» Communicating Complex Systems
Sort
View
CIKM
2010
Springer
13 years 6 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
CN
2008
108views more  CN 2008»
13 years 6 months ago
An approach to the identification of network elements composing heterogeneous end-to-end paths
Today's networks are becoming increasingly complex and the ability to effectively and efficiently operate and manage them is ever more challenging. Ways to provide end-to-end...
Alessio Botta, Antonio Pescapè, Giorgio Ven...
EUROMED
2010
13 years 6 months ago
Realization of a Cartographic GIS for the Filing and Management of the Archaelogical Excavations in the Nelson's Island
The island of Nelson is situated around 7-8 miles far from the Egyptian Mediterranean coast, and about 25 km far from Alexandria of Egypt. It has small size, since it doesn't ...
Domenica Costantino, Maria Giuseppa Angelini
ISSRE
2010
IEEE
13 years 6 months ago
Automata-Based Verification of Security Requirements of Composite Web Services
— With the increasing reliance of complex real-world applications on composite web services assembled from independently developed component services, there is a growing need for...
Hongyu Sun, Samik Basu, Vasant Honavar, Robyn R. L...
JCT
2010
83views more  JCT 2010»
13 years 6 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
« Prev « First page 4869 / 4885 Last » Next »