Sciweavers

266 search results - page 12 / 54
» Can Saturation Be Parallelised
Sort
View
ICRA
2009
IEEE
140views Robotics» more  ICRA 2009»
14 years 2 months ago
A miniature ceiling walking robot with flat tacky elastomeric footpads
—In this paper, the design, analysis, and development of a sixteen-legged palm-sized climbing robot using flat bulk tacky elastomer adhesives as an attachment method is presente...
Ozgur Unver, Metin Sitti
EVOW
2009
Springer
14 years 2 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
SEMWEB
2009
Springer
14 years 1 months ago
A Reasoning Broker Framework for OWL
Abstract. Semantic applications that utilise OWL ontologies can benefit from a broad range of OWL reasoning systems, which allow for the inference of implicit knowledge from expli...
Jürgen Bock, Tuvshintur Tserendorj, Yongchun ...
IWOMP
2007
Springer
14 years 1 months ago
Support for Fine Grained Dependent Tasks in OpenMP
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
Oliver Sinnen, Jsun Pe, Alexander Vladimirovich Ko...
PPAM
2007
Springer
14 years 1 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling