10890 search results - page 1898 / 2178 » Automatic Complexity Analysis |
209
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
179
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
158
click to vote
GIS
2008
ACM
15 years 7 months ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
192
click to vote
GRC
2008
IEEE
15 years 7 months ago
2008
IEEE
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
190
click to vote
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
—Since many embedded systems execute a predefined set of programs, tuning system components to application programs and data is the approach chosen by many design techniques to o...