5316 search results - page 210 / 1064 » Which Search Problems Are Random |
129
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
137
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
148
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
252
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
140
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...