1996 search results - page 205 / 400 » Financial Theory 2 |
156
click to vote
FGCS
2006
15 years 6 months ago
2006
This paper presents a predictable and grouped genetic algorithm (PGGA) for job scheduling. The novelty of the PGGA is twofold: (1) a job workload estimati...
107
click to vote
IOR
2008
15 years 6 months ago
2008
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
179
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
156
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...