Sciweavers

9631 search results - page 121 / 1927
» The Costs of Using JXTA
Sort
View
HASE
2008
IEEE
16 years 29 days ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
DFT
2006
IEEE
92views VLSI» more  DFT 2006»
16 years 17 days ago
Low-Cost Hardening of Image Processing Applications Against Soft Errors
Image processing systems are increasingly used in safetycritical applications, and their hardening against soft errors becomes an issue. We propose a methodology to identify soft ...
Ilia Polian, Bernd Becker, Masato Nakasato, Satosh...
ICPP
2005
IEEE
16 years 3 days ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
ICRA
2005
IEEE
120views Robotics» more  ICRA 2005»
16 years 3 days ago
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
David Hsu, Gildardo Sánchez-Ante, Zheng Sun
CP
2003
Springer
15 years 11 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann