366 search results - page 7 / 74 » Dynamic Programming for Graphs on Surfaces |
ESA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
The multi domain nature of a mechatronic system makes it difficult to model using a single modeling technique over the whole system as varying sets of system variables are require...
QRE
2010
2010
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
13 years 5 months ago
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
SCAM
2002
IEEE
13 years 11 months ago
2002
IEEE
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
ACSC
2003
IEEE
14 years 9 hour ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...