1277 search results - page 31 / 256 » Terminating Decision Algorithms Optimally |
100
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime inte...
JDA
2007
15 years 2 months ago
2007
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
131
click to vote
MOBIHOC
2001
ACM
16 years 2 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
118
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
103
click to vote
AAAI
2004
15 years 4 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...