2917 search results - page 60 / 584 » Satisfying Interaction Constraints |
CADE
2007
Springer
14 years 9 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
INFOCOM
1994
IEEE
14 years 28 days ago
1994
IEEE
This paper is motivated by the need to support multiple service classes in fast packet-switched networks. We address the problem of characterizing and designing scheduling policie...
DSVIS
1995
Springer
14 years 11 days ago
1995
Springer
Abstract. This paper describes a design technique for interactive systems that allows designs to be specified and refined formally, using a notation based on Action Systems. The ...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
Component-based models represent a dominant trend in the construction of wide-area network applications, making possible the integration of diverse functionality contained in modu...
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the...