Sciweavers

14386 search results - page 75 / 2878
» The Chinese Generals Problem
Sort
View
MA
2010
Springer
85views Communications» more  MA 2010»
15 years 1 months ago
K-sample subsampling in general spaces: The case of independent time series
The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case ...
Dimitris N. Politis, Joseph P. Romano
MFCS
2004
Springer
15 years 8 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
15 years 9 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
CP
2006
Springer
15 years 7 months ago
General Symmetry Breaking Constraints
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
Toby Walsh
CORR
2010
Springer
176views Education» more  CORR 2010»
15 years 3 months ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi