Sciweavers

2333 search results - page 446 / 467
» Recursive Computational Depth
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
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...
Daniel H. Leventhal, Meinolf Sellmann
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
13 years 9 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
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...
Diego Arroyuelo
ATAL
2010
Springer
13 years 9 months ago
Multi robotic exploration with communication requirement to a fixed base station
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
AES
2007
Springer
75views Cryptology» more  AES 2007»
13 years 8 months ago
Improved FVM for two-layer shallow-water models: Application to the Strait of Gibraltar
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...
Manuel Jose Castro Díaz, José A. Gar...
BMCBI
2007
154views more  BMCBI 2007»
13 years 8 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
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...