2917 search results - page 60 / 584 » Satisfying Interaction Constraints |
116
click to vote
CADE
2007
Springer
16 years 4 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...
124
click to vote
INFOCOM
1994
IEEE
15 years 8 months 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...
109
click to vote
DSVIS
1995
Springer
15 years 7 months 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 ...
176
click to vote
IPPS
2003
IEEE
15 years 9 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...
136
click to vote
ICTAI
2006
IEEE
15 years 10 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...