1717 search results - page 61 / 344 » On the analysis of the (1 1) memetic algorithm |
102
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
123
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
112
Voted
SIGECOM
2008
ACM
15 years 16 days ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
111
Voted
STOC
2009
ACM
15 years 7 months ago
2009
ACM
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
DISOPT
2010
15 years 21 days ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...