1866 search results - page 15 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
We present a new matrix formulation of the face hypercube embedding problem that motivates the design of an efficient search strategy to find an encoding that satisfies all fac...
PAKDD
2010
ACM
13 years 8 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
GECCO
2004
Springer
14 years 3 days ago
2004
Springer
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
WOWMOM
2006
ACM
14 years 20 days ago
2006
ACM
This paper studies a Bad Apple phenomenon caused by Head-of-Line blocking in IEEE 802.11 networks. This problem can adversely affect the performance of wireless multimedia streami...
OL
2011
13 years 1 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...