Sciweavers

1147 search results - page 71 / 230
» Termination in language-based systems
Sort
View
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
14 years 10 months ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
ACL
1998
13 years 11 months ago
Automatically Creating Bilingual Lexicons for Machine Translation from Bilingual Text
A method is presented for automatically augmenting the bilingual lexicon of an existing Machine Translation system, by extracting bilingual entries from aligned bilingual text. Th...
Davide Turcato
RTA
2011
Springer
13 years 23 days ago
Maximal Completion
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
Dominik Klein, Nao Hirokawa
DAC
2004
ACM
14 years 11 months ago
Placement feedback: a concept and method for better min-cut placements
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...
Andrew B. Kahng, Sherief Reda
BIRTHDAY
2007
Springer
14 years 4 months ago
The Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
Nachum Dershowitz, Georg Moser