3359 search results - page 130 / 672 » A Simplified Idea Algorithm |
123
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
124
Voted
EVOW
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
126
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
143
Voted
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, we present an Extended Kalman Filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the n...
107
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel ...