3864 search results - page 456 / 773 » time 2005 |
178
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
178
click to vote
ISSAC
2005
Springer
16 years 8 days ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
138
click to vote
VLDB
2005
ACM
16 years 7 days ago
2005
ACM
With the advent of chip multiprocessors, exploiting intra-transaction parallelism is an attractive way of improving transaction performance. However, exploiting intra-transaction ...
166
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
196
Voted
RTSS
2005
IEEE
16 years 10 days ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...