Sciweavers

4377 search results - page 286 / 876
» Mass problems and randomness
Sort
View
PPSN
2004
Springer
16 years 24 days ago
Optimization via Parameter Mapping with Genetic Programming
Abstract. This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the new ...
João Carlos Figueira Pujol, Riccardo Poli
CCCG
2009
15 years 8 months ago
Clarkson's Algorithm for Violator Spaces
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
Yves Brise, Bernd Gärtner
182
Voted
CORR
2007
Springer
101views Education» more  CORR 2007»
15 years 7 months ago
Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
Oliver Kosut, Lang Tong
IEEEHPCS
2010
15 years 6 months ago
3-SAT on CUDA: Towards a massively parallel SAT solver
This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features ...
Quirin Meyer, Fabian Schonfeld, Marc Stamminger, R...
206
Voted
IEICET
2010
124views more  IEICET 2010»
15 years 4 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
Ruka Tanahashi, Zhi-Zhong Chen