10988 search results - page 243 / 2198 » Algorithmic Folding Complexity |
170
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
125
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint languag...
150
click to vote
AAAI
2007
15 years 6 months ago
2007
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
140
Voted
WSCG
2004
15 years 5 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
123
Voted
AAAI
1998
15 years 5 months ago
1998
The Integrated Processing and Understanding of Signals (IPUS) architecture is a general blackboard framework for structuring bidirectional interaction between front-end signal pro...