Sciweavers

996 search results - page 56 / 200
» A general method to speed up fixed-parameter-tractable algor...
Sort
View
AAAI
2006
15 years 7 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
FLAIRS
2008
15 years 8 months ago
CANDEL: An Algorithm for Same-Sentence Pronominal Resolution
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
Cristina Nicolae, Gabriel Nicolae
DNA
2003
Springer
153views Bioinformatics» more  DNA 2003»
15 years 11 months ago
Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly
Abstract. For robust molecular implementation of tile-based algorithmic self-assembly, methods for reducing errors must be developed. Previous studies suggested that by control of ...
Erik Winfree, Renat Bekbolatov
ANTSW
2004
Springer
15 years 10 months ago
Mesh-Partitioning with the Multiple Ant-Colony Algorithm
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
Peter Korosec, Jurij Silc, Borut Robic
SC
2005
ACM
15 years 11 months ago
Tera-Scalable Algorithms for Variable-Density Elliptic Hydrodynamics with Spectral Accuracy
We describe Miranda, a massively parallel spectral/compact solver for variabledensity incompressible flow, including viscosity and species diffusivity effects. Miranda utilizes...
Andrew W. Cook, William H. Cabot, Peter L. William...