Sciweavers

2887 search results - page 276 / 578
» Name Generation and Linearity
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 6 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
AML
2010
96views more  AML 2010»
15 years 6 months ago
Implicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this proce...
Petr Cintula, Carles Noguera
JCO
2008
102views more  JCO 2008»
15 years 6 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
ECCC
2007
99views more  ECCC 2007»
15 years 6 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
PERCOM
2006
ACM
15 years 6 months ago
Bootstrapping Chord in Ad Hoc Networks: Not Going Anywhere for a While.
With the growing prevalence of wireless devices, infrastructure-less ad hoc networking is coming closer to reality. Research in this field has mainly been concerned with routing. ...
Curt Cramer, Thomas Fuhrmann