Sciweavers

828 search results - page 73 / 166
» Bounded Hairpin Completion
Sort
View
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 7 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
ALT
2000
Springer
14 years 7 months ago
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describ...
Gunter Grieser, Steffen Lange, Thomas Zeugmann
HYBRID
2009
Springer
14 years 4 months ago
Event-Triggering in Distributed Networked Systems with Data Dropouts and Delays
This paper studies distributed networked systems with data dropouts and transmission delays. We propose a decentralized eventtriggering scheme, where a subsystem broadcasts its sta...
Xiaofeng Wang, Michael D. Lemmon
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 4 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
CSR
2009
Springer
14 years 4 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma