Sciweavers

536 search results - page 106 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
WWW
2003
ACM
14 years 8 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
RAID
2009
Springer
14 years 1 months ago
Autonomic Intrusion Detection System
Abstract. We propose a novel framework of autonomic intrusion detection that fulfills online and adaptive intrusion detection in unlabeled audit data streams. The framework owns a...
Wei Wang 0012, Thomas Guyet, Svein J. Knapskog
SMALLTALK
2007
Springer
14 years 1 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
ECAL
2005
Springer
14 years 26 days ago
A Self-organising, Self-adaptable Cellular System
Abstract. Inspired by the recent advances in evolutionary biology, we have developed a self-organising, self-adaptable cellular system for multitask learning. The main aim of our p...
Lucien Epiney, Mariusz Nowostawski
OOIS
1994
Springer
13 years 11 months ago
Problems, Descriptions and Objects
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...
Michael Jackson