2899 search results - page 371 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
142
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
In order to efficiently design complex microelectromechanical systems (MEMS) having large numbers of multi-domain components, a hierarchically structured design approach that is ...
147
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
187
click to vote
VLDB
1991
ACM
15 years 10 months ago
1991
ACM
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
195
click to vote
CONEXT
2008
ACM
15 years 8 months ago
2008
ACM
Enterprise networks are important, with size and complexity even surpassing carrier networks. Yet, the design of enterprise networks remains ad-hoc and poorly understood. In this p...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...