1940 search results - page 353 / 388 » Graph Transformation with Variables |
137
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
143
Voted
SARA
2009
Springer
15 years 9 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
105
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
125
Voted
CGO
2006
IEEE
15 years 8 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
134
click to vote
PLDI
2004
ACM
15 years 8 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...