4103 search results - page 233 / 821 » Some results on the Collatz problem |
205
click to vote
ASP
2001
Springer
15 years 11 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
175
click to vote
ASP
2001
Springer
15 years 11 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
192
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
151
click to vote
WETICE
2000
IEEE
15 years 11 months ago
2000
IEEE
We introduce a conceptual framework that articulates the mechanics of collaboration for shared-workspace groupware: the low level actions and interactions that must be carried out...
184
click to vote
IMPERIAL
1993
15 years 10 months ago
1993
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...