Sciweavers

1594 search results - page 44 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
ICRA
2010
IEEE
194views Robotics» more  ICRA 2010»
14 years 10 months ago
Continuous collision detection for non-rigid contact computations using local advancement
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...
Min Tang, Young J. Kim, Dinesh Manocha
ISCAPDCS
2007
15 years 1 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 5 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
PPSN
2010
Springer
14 years 9 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
RECOMB
2006
Springer
16 years 2 days ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...