707 search results - page 71 / 142 » Solving path problems on the GPU |
ISSTA
2006
ACM
15 years 5 months ago
2006
ACM
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
ECAI
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. We address the problem of continuous stochastic optimal control in the presence of hard obstacles. Due to the non-smooth character of the obstacles, the traditional appro...
EOR
2008
14 years 12 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...