Sciweavers

281 search results - page 32 / 57
» Concurrent Java Test Generation as a Search Problem
Sort
View
SIGSOFT
2010
ACM
13 years 5 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
IICS
2010
Springer
13 years 11 months ago
An Evaluation Framework for Semantic Search in P2P Networks
: We address the problem of evaluating peer-to-peer information retrieval (P2PIR) systems with semantic overlay structure. The P2PIR community lacks a commonly accepted testbed, su...
Florian Holz, Hans Friedrich Witschel, Gregor Hein...
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
14 years 13 hour ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
ICASSP
2009
IEEE
14 years 2 months ago
Fast LCD motion deblurring by decimation and optimization
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
Stanley H. Chan, Truong Q. Nguyen
CEC
2009
IEEE
14 years 2 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang