Sciweavers

1208 search results - page 35 / 242
» Uniform eventown problems
Sort
View
ARCS
2008
Springer
15 years 1 months ago
How Efficient are Creatures with Time-shuffled Behaviors?
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
Patrick Ediger, Rolf Hoffmann, Mathias Halbach
CORR
2010
Springer
157views Education» more  CORR 2010»
14 years 11 months ago
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
Richard Beigel, Bin Fu
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 11 months ago
Circle Formation of Weak Mobile Robots
The contribution is twofold. We first show the validity of the conjecture of D
Yoann Dieudonné, Ouiddad Labbani-Igbida, Fr...
RTA
2010
Springer
15 years 3 months ago
Termination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
ICML
2008
IEEE
16 years 15 days ago
Estimating labels from label proportions
Consider the following problem: given sets of unlabeled observations, each set with known label proportions, predict the labels of another set of observations, also with known lab...
Alex J. Smola, Novi Quadrianto, Quoc V. Le, Tib&ea...