2343 search results - page 322 / 469 » The Locomotive Routing Problem |
92
Voted
JCSS
1998
15 years 4 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
144
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
165
click to vote
ASPDAC
2010
ACM
15 years 3 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...
185
click to vote
AAAI
2012
13 years 7 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
160
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...