Sciweavers

8540 search results - page 1311 / 1708
» The Dynamic Servers Problem
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
AAMAS
2007
Springer
15 years 11 months ago
Optimal Control in Large Stochastic Multi-agent Systems
Abstract. We study optimal control in large stochastic multi-agent systems in continuous space and time. We consider multi-agent systems where agents have independent dynamics with...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
ATAL
2007
Springer
15 years 11 months ago
Estimating information value in collaborative multi-agent planning systems
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
David Sarne, Barbara J. Grosz
ATAL
2007
Springer
15 years 11 months ago
Periodic real-time resource allocation for teams of progressive processing agents
In this paper, we focus on the problem of finding a periodic allocation strategy for teams of resource-bounded agents. We propose a real-time dynamic algorithm RTDA , that exploi...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
15 years 11 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
« Prev « First page 1311 / 1708 Last » Next »