2796 search results - page 186 / 560 » The coolest path problem |
220
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
144
click to vote
EJC
2006
15 years 6 months ago
2006
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
159
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Despite the large body of work in both motion planning and multi-agent simulation, little work has focused on the problem of planning motion for groups of robots using external...
169
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
192
click to vote
ASPDAC
2004
ACM
15 years 12 months ago
2004
ACM
— The problem of minimizing dynamic power consumption by scaling down the supply voltage of computational elements off critical paths is widely addressed in the literature for th...