Sciweavers

358 search results - page 46 / 72
» Report on Generic Case Complexity
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
15 years 10 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
69
Voted
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
15 years 5 months ago
Online allocation of display advertisements subject to advanced sales contracts
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenji...
84
Voted
CBSE
2005
Springer
15 years 3 months ago
A Component-Oriented Model for the Design of Safe Multi-threaded Applications
We previously developed a component-oriented model that combines ideas from self-organizing architectures and from design by contract to address the complexity of design in multi-t...
Reimer Behrends, R. E. Kurt Stirewalt, Laura K. Di...
99
Voted
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 2 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
EUROMICRO
2009
IEEE
15 years 2 months ago
Service Redundancy Strategies in Service-Oriented Architectures
Redundancy can improve the availability of components in service-oriented systems. However, predicting and quantifying the effects of different redundancy strategies can be a comp...
Nicholas R. May, Heinz W. Schmidt, Ian E. Thomas