Sciweavers

658 search results - page 88 / 132
» Partially Ordered Constraint Optimization Problems
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
13 years 3 days ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
AAAI
2012
13 years 3 days ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
DAC
2003
ACM
15 years 10 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 10 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 4 months ago
CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...
Debabrata Dash, Neoklis Polyzotis, Anastasia Ailam...