Sciweavers

5105 search results - page 647 / 1021
» An algorithm to determine peer-reviewers
Sort
View
IJAC
2008
84views more  IJAC 2008»
15 years 7 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
IJAIT
2008
107views more  IJAIT 2008»
15 years 7 months ago
Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
GPEM
2006
127views more  GPEM 2006»
15 years 7 months ago
A hierarchical particle swarm optimizer for noisy and dynamic environments
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a...
Stefan Janson, Martin Middendorf
CGF
2007
145views more  CGF 2007»
15 years 7 months ago
Bitmask Soft Shadows
Recently, several real-time soft shadow algorithms have been introduced which all compute a single shadow map and use its texels to obtain a discrete scene representation. The res...
Michael Schwarz, Marc Stamminger
CN
2007
148views more  CN 2007»
15 years 7 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel