Sciweavers

356 search results - page 5 / 72
» Revisiting the Paxos Algorithm
Sort
View
VTS
1997
IEEE
96views Hardware» more  VTS 1997»
13 years 11 months ago
Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors
Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a sm...
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. P...
ACL
2010
13 years 4 months ago
SVD and Clustering for Unsupervised POS Tagging
We revisit the algorithm of Sch
Michael Lamar, Yariv Maron, Mark Johnson, Elie Bie...
ICGI
2010
Springer
13 years 5 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
13 years 10 months ago
Revisiting evolutionary algorithms with on-the-fly population size adjustment
In an evolutionary algorithm, the population has a very important role as its size has direct implications regarding solution quality, speed, and reliability. Theoretical studies ...
Fernando G. Lobo, Cláudio F. Lima
PAAPP
2006
44views more  PAAPP 2006»
13 years 6 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner