1485 search results - page 35 / 297 » Whole Program Paths |
126
click to vote
JUCS
2010
15 years 22 days ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
119
click to vote
WCET
2010
15 years 4 days ago
2010
Calculating the worst-case execution time (WCET) of real-time tasks is still a tedious job. Programmers are required to provide additional information on the program flow, analyzi...
119
click to vote
HEURISTICS
2002
15 years 2 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
129
click to vote
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
107
click to vote
ICPP
1996
IEEE
15 years 6 months ago
1996
IEEE
The ability to automatically parallelize standard programming languages results in program portability across a wide range of machine architectures. It is the goal of the Polaris ...