Oskar-Bordeaux: Dépôts récents
Voici les éléments 2301-2320 de 97003
-
Virtual Objects on Real Oceans
Communication dans un congrès -
Navidget for 3D Interaction: Camera Positioning and Further Uses
(International Journal of Human-Computer Studies. pp. to appear, 2008-11-14)Article de revue -
[Sans titre]
Communication dans un congrès -
NewMadeleine : ordonnancement et optimisation de schemas de communication haute performance.
(Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques. vol. vol. 27, n° 3-4/2008, 2008)Article de revue -
Constructing Incremental Sequences in Graphs
(Algorithmic Operations Research. vol. 1, n° 2, pp. 1--7, 2006)Article de revue -
Fast Radio Broadcasting with Advice
Communication dans un congrès -
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Communication dans un congrès -
Memoryless search algorithms in a network with faulty advice
(Theoretical Computer Science. vol. 402, n° 2-3, pp. 190-198, 2008)Article de revue -
A view selection algorithm with performance guarantee
Communication dans un congrès -
Non-searchability of random scale-free graphs
Communication dans un congrès -
Fusion and fission of genes define a metric between fungal genomes.
(PLoS Computational Biology. vol. 4, n° 10, pp. e1000200, 2008-10)Article de revue -
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Communication dans un congrès -
Genolevures: protein families and synteny among complete hemiascomycetous yeast proteomes and genomes.
(Nucleic Acids Research. n° 37, pp. D550-D554, 2009)Article de revue -
Impact of memory size on graph exploration capability
(Discrete Applied Mathematics. vol. 156, n° 12, pp. 2310-2319, 2008-06)Article de revue -
Label-Guided Graph Exploration by a Finite Automaton
(ACM Transactions on Algorithms. vol. 4, n° 4, pp. Article 42, 2008-08)Article de revue -
Setting port numbers for fast graph exploration
(Theoretical Computer Science. vol. 401, n° 1-3, pp. 236-242, 2008-07)Article de revue -
Tree exploration with advice
(Information and Computation. vol. 206, n° 11, pp. 1276-1287, 2008-11)Article de revue -
An Efficient Probabilistic Population-Based Descent for the Median Genome Problem
Communication dans un congrès -
Compact Labelings For Efficient First-Order Model-Checking
(Journal of Combinatorial Optimization. vol. 21, n° 1, pp. 19--46, 2011-01-07)Article de revue -
Approximation bounds for Black Hole Search problems
(Networks. vol. 52, n° 4, pp. 216--226, 2008-12)Article de revue