Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
d Abstract) Piyoosh Mukhija IIIT Hyderabad Rahul Sawhney IIIT Hyderabad K Madhava Krishna IIIT Hyderabad We present an algorithm for multi robotic exploration of an unknown terrai...
Piyoosh Mukhija, Rahul Sawhney, K. Madhava Krishna
This paper deals with the numerical simulation of flows of stratified fluids through channels with irregular geometry. Channel crosssections are supposed to be symmetric but no...
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...