Sciweavers

1188 search results - page 108 / 238
» Extended Graph Unification
Sort
View
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
14 years 8 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis
WIOPT
2010
IEEE
14 years 8 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
ENTCS
2011
77views more  ENTCS 2011»
14 years 5 months ago
Quantum Circuits: From a Network to a One-Way Model
Abstract—We present elements of quantum circuits translations from the (standard) network or circuit model to the one-way one. We present a translation scheme, give an account of...
Larisse Voufo
CC
2011
Springer
267views System Software» more  CC 2011»
14 years 1 months ago
Using Disjoint Reachability for Parallelization
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
AAAI
2012
13 years 12 days ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer