Sciweavers

3875 search results - page 712 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
CEC
2007
IEEE
14 years 2 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 1 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 22 days ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan