2300 search results - page 283 / 460 » Maximally Concurrent Programs |
168
click to vote
CLIMA
2010
15 years 8 months ago
2010
We present an algorithm for finding uniform strategies in multi-agent systems with incomplete information. The algorithm finds all maximal uniform strategies for agents with incomp...
185
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
165
click to vote
ACL
1998
15 years 7 months ago
1998
The paper describes a novel computational tool for multiple concept learning. Unlike previous approaches, whose major goal is prediction on unseen instances rather than the legibi...
162
click to vote
IPL
2007
15 years 6 months ago
2007
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
163
Voted
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...