Sciweavers

52 search results - page 3 / 11
» Pict Correctness Revisited
Sort
View
AAAI
2000
13 years 9 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
RECOMB
2005
Springer
14 years 8 months ago
On Sorting by Translocations
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
Anne Bergeron, Julia Mixtacki, Jens Stoye
JLP
2010
96views more  JLP 2010»
13 years 6 months ago
Implicit characterizations of FPTIME and NC revisited
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Karl-Heinz Niggl, Henning Wunderlich
IAT
2007
IEEE
14 years 2 months ago
Revisiting ADOPT-ing and its Feedback Schemes
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...
Marius-Calin Silaghi, Makoto Yokoo
PAAPP
2006
44views more  PAAPP 2006»
13 years 7 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