Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
— As the scale and complexity of parallel systems continue to grow, failures become more and more an inevitable fact for solving large-scale applications. In this research, we pr...
In many different applications on the Web, distributed agents would like to discover and access high quality information sources. This is a challenging problem since an agent does...
— We consider the control of impulsive systems with jumps triggered by a renewal process, that is, the intervals between jumps are independent and identically distributed. The co...
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Only a subset of these MARL algorithms both do not require agent...