Sciweavers

194 search results - page 33 / 39
» Approximate dynamic programming: Lessons from the field
Sort
View
104
Voted
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
15 years 10 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich

Lecture Notes
1005views
17 years 1 months ago
Lectures on reconfigurable computing
Driven by recent innovations in Field-Programmable Gate Arrays (FPGAs), reconfigurable computing offers unique ways to accelerate key algorithms. FPGAs offer a programmable logic f...
Sherief Reda
ICCS
2007
Springer
15 years 8 months ago
Creating Individual Based Models of the Plankton Ecosystem
Abstract. The Virtual Ecology Workbench (VEW) is a suite of utilities for creating, executing and analysing biological models of the ocean. At its core is a mathematical language a...
Wes Hinsley, Tony Field, John Woods
EUMAS
2006
15 years 3 months ago
Near-Optimal Anytime Coalition Structure Generation
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that...
Talal Rahwan, Sarvapali D. Ramchurn, Viet Dung Dan...
ATAL
2007
Springer
15 years 8 months ago
Q-value functions for decentralized POMDPs
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
Frans A. Oliehoek, Nikos A. Vlassis