12052 search results - page 345 / 2411 » computing 2010 |
182
click to vote
MMB
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
149
click to vote
CLEIEJ
2010
15 years 4 months ago
2010
This article presents the design, implementation and use of a remote network lab with multiple users support as an aid to teaching computer networks. The purpose is to enable mult...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
174
click to vote
AAAI
2010
15 years 8 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
171
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...