6036 search results - page 1111 / 1208 » Web search solved |
145
Voted
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
133
click to vote
ICCAD
2008
IEEE
16 years 1 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
165
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
159
click to vote
SARA
2009
Springer
15 years 11 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...
171
click to vote
SCIA
2009
Springer
15 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...