Sciweavers

2434 search results - page 187 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
INFOCOM
2010
IEEE
15 years 2 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
AUSAI
2003
Springer
15 years 9 months ago
Choosing Learning Algorithms Using Sign Tests with High Replicability
An important task in machine learning is determining which learning algorithm works best for a given data set. When the amount of data is small the same data needs to be used repea...
Remco R. Bouckaert
COMPGEOM
2003
ACM
15 years 9 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
ENTCS
2006
113views more  ENTCS 2006»
15 years 4 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani