Sciweavers

1074 search results - page 189 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
15 years 1 months ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
AI
2010
Springer
14 years 9 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
ML
2008
ACM
101views Machine Learning» more  ML 2008»
14 years 9 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...