Sciweavers

16404 search results - page 769 / 3281
» A set coverage problem
Sort
View
CDC
2010
IEEE
108views Control Systems» more  CDC 2010»
15 years 2 months ago
Optimal pursuit of moving targets using dynamic Voronoi diagrams
We consider Voronoi-like partitions for a team of moving targets distributed in the plane, such that each set in this partition is uniquely associated with a particular moving targ...
Efstathios Bakolas, Panagiotis Tsiotras
INFORMATICALT
2011
89views more  INFORMATICALT 2011»
15 years 2 months ago
Large-Scale Data Analysis Using Heuristic Methods
Estimation and modelling problems as they arise in many data analysis areas often turn out to be unstable and/or intractable by standard numerical methods. Such problems frequently...
Gintautas Dzemyda, Leonidas Sakalauskas
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 9 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
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
15 years 8 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...