Sciweavers

413 search results - page 80 / 83
» Are Hopfield Networks Faster than Conventional Computers
Sort
View
FC
2007
Springer
125views Cryptology» more  FC 2007»
16 years 1 days ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
BIRTHDAY
2005
Springer
15 years 11 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
SIGCOMM
1999
ACM
15 years 10 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
CIKM
2010
Springer
15 years 4 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
ICDCS
2008
IEEE
16 years 9 days ago
Toward Predictive Failure Management for Distributed Stream Processing Systems
Distributed stream processing systems (DSPSs) have many important applications such as sensor data analysis, network security, and business intelligence. Failure management is ess...
Xiaohui Gu, Spiros Papadimitriou, Philip S. Yu, Sh...