1074 search results - page 107 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
134
click to vote
JMLR
2006
15 years 3 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
143
click to vote
AAAI
2008
15 years 5 months ago
2008
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
133
click to vote
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
124
click to vote
SIGMETRICS
2005
ACM
15 years 9 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
136
click to vote
AIMSA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....