A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
ontingent abstraction for robust robot control Joelle Pineau, Geoff Gordon and Sebastian Thrun School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 This pape...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchorbased localization algorithm for mobile wireless sensor ne...
This paper proposes the applications of soft computing to deal with the constraints in conventional modelling techniques of the dynamic extrusion process. The proposed technique i...
Leong Ping Tan, Ahmad Lotfi, Eugene Lai, J. B. Hul...