2607 search results - page 297 / 522 » Complete Functional Synthesis |
171
click to vote
LICS
1998
IEEE
15 years 8 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
158
click to vote
NIPS
2001
15 years 5 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
126
click to vote
ICWS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
124
Voted
NETWORKING
2000
15 years 5 months ago
2000
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to ...
132
click to vote
AIPS
2010
15 years 4 months ago
2010
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...