Sciweavers

915 search results - page 116 / 183
» Maximally Abstract Retrenchments
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
CONCUR
2009
Springer
14 years 2 months ago
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
Sergio Giro, Pedro R. D'Argenio, Luis María...
EUROSSC
2009
Springer
14 years 2 months ago
A Context Lifecycle for Web-Based Context Management Services
Abstract. During the development of context aware applications a context management component must traditionally be created. This task requires specialist context lifecycle managem...
Gearoid Hynes, Vinny Reynolds, Manfred Hauswirth
ICCS
2009
Springer
14 years 2 months ago
A Massively Parallel Architecture for Bioinformatics
Abstract. Today’s general purpose computers lack in meeting the requirements on computing performance for standard applications in bioinformatics like DNA sequence alignment, err...
Gerd Pfeiffer, Stefan Baumgart, Jan Schröder,...
ISICA
2009
Springer
14 years 2 months ago
Detecting Network Anomalies Using CUSUM and EM Clustering
Abstract. Intrusion detection has been extensively studied in the last two decades. However, most existing intrusion detection techniques detect limited number of attack types and ...
Wei Lu, Hengjian Tong