1716 search results - page 271 / 344 » Proving Conditional Termination |
101
click to vote
RTSS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
75
Voted
ATAL
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. The agent design problem is as follows: Given an environment, together with a specification of a task, is it possible to construct an agent that will guarantee to succes...
106
Voted
LPAR
1999
Springer
15 years 5 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
101
Voted
ECOOP
1998
Springer
15 years 5 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
90
Voted
INFOCOM
1997
IEEE
15 years 5 months ago
1997
IEEE
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...