672 search results - page 30 / 135 » A General Solution to the Graph History Interaction Problem |
EUROGP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
ATAL
2004
Springer
14 years 29 days ago
2004
Springer
In multi-agent MDPs, it is generally necessary to consider the joint state space of all agents, making the size of the problem and the solution exponential in the number of agents...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...