Sciweavers

1529 search results - page 116 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 4 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
IJON
2007
134views more  IJON 2007»
15 years 4 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy
AIPS
2006
15 years 5 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
146
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 11 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...
HPCC
2005
Springer
15 years 9 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold