9842 search results - page 1675 / 1969 » The Complexity of the Matching-Cut Problem |
122
click to vote
CEAS
2005
Springer
15 years 10 months ago
2005
Springer
Unsolicited Commercial Communication also known as spam - has traditionally been the most visible e-mail threat and has reached a point where it creates a major problem for the de...
130
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
149
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
135
click to vote
EGH
2004
Springer
15 years 10 months ago
2004
Springer
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
124
click to vote
CGO
2003
IEEE
15 years 10 months ago
2003
IEEE
Predicated execution can eliminate hard to predict branches and help to enable instruction level parallelism. Many current predication variants exist where the result update is co...