Sciweavers

81 search results - page 6 / 17
» Quantum Algorithms for Element Distinctness
Sort
View
ISCAPDCS
2007
13 years 8 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
IPPS
1999
IEEE
13 years 11 months ago
Irregular Parallel Algorithms in JAVA
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...
Brian Blount, Siddhartha Chatterjee, Michael Phili...
CGVR
2008
13 years 8 months ago
A Graph Drawing Algorithm for the Game of Sprouts
- A graph drawing algorithm for the Game of Sprouts is presented. The algorithm guarantees that the polylines that connect graph nodes are drawn smoothly and that they maintain rea...
Wayne Brown, Leemon C. Baird III
DATESO
2010
150views Database» more  DATESO 2010»
13 years 5 months ago
Evolving Quasigroups by Genetic Algorithms
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
Václav Snásel, Jiri Dvorský, ...
EACL
1993
ACL Anthology
13 years 8 months ago
A Discourse Copying Algorithm for Ellipsis and Anaphora Resolution
We give an analysis of ellipsis resolution in terms of a straightforward discourse copying algorithm that correctly predicts a wide range of phenomena. The treatment does not suff...
Andrew Kehler