15033 search results - page 334 / 3007 » Complexity Theory and Algorithms |
155
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
136
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
152
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
167
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
137
click to vote
AAECC
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...