366 search results - page 10 / 74 » Dynamic Programming for Graphs on Surfaces |
ICSE
2003
IEEE-ACM
14 years 6 months ago
2003
IEEE-ACM
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
ICRA
2006
IEEE
14 years 23 days ago
2006
IEEE
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...
MVA
1998
13 years 8 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
ICPP
1993
IEEE
13 years 10 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
GECCO
2007
Springer
14 years 26 days ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...