Sciweavers

1160 search results - page 42 / 232
» Dynamic Programming Algorithm for Training Functional Networ...
Sort
View
POPL
2010
ACM
14 years 5 months ago
From Program Verification to Program Synthesis
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
WEA
2007
Springer
178views Algorithms» more  WEA 2007»
14 years 2 months ago
Engineering Fast Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
Peter Sanders, Dominik Schultes
AAAI
2010
13 years 10 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
DFG
2009
Springer
14 years 3 months ago
Engineering Route Planning Algorithms
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
Daniel Delling, Peter Sanders, Dominik Schultes, D...
INFOCOM
2007
IEEE
14 years 2 months ago
Reverse Engineering TCP/IP-Like Networks Using Delay-Sensitive Utility Functions
Abstract— TCP/IP can be interpreted as a distributed primaldual algorithm to maximize aggregate utility over source rates. It has recently been shown that an equilibrium of TCP/I...
John Pongsajapan, Steven H. Low