Sciweavers

1477 search results - page 156 / 296
» Random Convex Programs
Sort
View
WICOMM
2010
91views more  WICOMM 2010»
13 years 7 months ago
A sensing-based cognitive coexistence method for interfering infrastructure and ad hoc systems
The rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an in...
Stefan Geirhofer, Lang Tong, Brian M. Sadler
MP
2011
13 years 4 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
SIGSOFT
2008
ACM
14 years 9 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 9 days ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
14 years 2 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai