Sciweavers

2150 search results - page 26 / 430
» On a restricted cross-intersection problem
Sort
View
AAAI
1996
14 years 11 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
CADE
2010
Springer
14 years 10 months ago
An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
Yevgeny Kazakov
ISPDC
2007
IEEE
15 years 4 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
DLT
2010
14 years 11 months ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
Niko Haubold, Markus Lohrey, Christian Mathissen
SODA
1996
ACM
140views Algorithms» more  SODA 1996»
14 years 11 months ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan