2612 search results - page 284 / 523 » Switching Graphs and Their Complexity |
144
Voted
ADBIS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
176
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
136
Voted
ICPP
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper describes a novel compile-time list-based task scheduling algorithm for distributed-memory systems, called Fast Load Balancing (FLB). Compared to other typical list sch...
121
Voted
ASPDAC
1995
ACM
15 years 8 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
106
Voted
JETAI
2002
15 years 4 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...