Sciweavers

2446 search results - page 366 / 490
» Choiceless Polynomial Time
Sort
View
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 6 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
JCT
2010
72views more  JCT 2010»
13 years 6 months ago
Extensions and restrictions of Wythoff's game preserving its p positions
We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P posit...
Éric Duchêne, Aviezri S. Fraenkel, Ri...
MOR
2010
111views more  MOR 2010»
13 years 6 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
OTM
2010
Springer
13 years 6 months ago
Identifying and Eliminating Inconsistencies in Mappings across Hierarchical Ontologies
Abstract. Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can int...
Bhavesh Sanghvi, Neeraj Koul, Vasant Honavar
RECOMB
2010
Springer
13 years 6 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...