Sciweavers

2899 search results - page 91 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
INFOCOM
2008
IEEE
15 years 8 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 7 months ago
Harmony search for structural design
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
Zong Woo Geem, Kang Seok Lee, Chung-Li Tseng
GECCO
2005
Springer
121views Optimization» more  GECCO 2005»
15 years 7 months ago
New evolutionary techniques for test-program generation for complex microprocessor cores
Checking if microprocessor cores are fully functional at the end of the productive process has become a major issue. Traditional functional approaches are not sufficient when cons...
Ernesto Sánchez, Massimiliano Schillaci, Ma...
AAAI
2008
15 years 3 months ago
Generating Application-Specific Benchmark Models for Complex Systems
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
Jun Wang, Gregory M. Provan
IJCNN
2007
IEEE
15 years 7 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin