Sciweavers

491 search results - page 23 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
COR
2008
122views more  COR 2008»
13 years 7 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
NIPS
2008
13 years 9 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
BPM
2009
Springer
143views Business» more  BPM 2009»
13 years 8 months ago
MDPE Workbench - A Solution for Performance Related Decision Support
Abstract. Continuous optimization of business process execution including its adaptation to changes within the market environment or the company itself becomes increasingly importa...
Mathias Fritzsche, Jendrik Johannes, Sebastian Cec...
SIGMOD
1996
ACM
116views Database» more  SIGMOD 1996»
13 years 11 months ago
Optimizing Queries over Multimedia Repositories
Repositories of multimedia objects having multiple types of attributes e.g., image, text are becoming increasingly common. A selection on these attributes will typically produce n...
Surajit Chaudhuri, Luis Gravano