Sciweavers

6045 search results - page 1042 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
AIPS
2008
13 years 12 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
AIPS
2008
13 years 12 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
ANTSW
2008
Springer
13 years 11 months ago
Enhancing the Cooperative Transport of Multiple Objects
In this paper we present an approach to the cooperative transport of multiple objects in swarm robotics. The approach is motivated by the observation that the performance of cooper...
Antoine Decugnière, Benjamin Poulain, Alexa...
ASPDAC
2008
ACM
135views Hardware» more  ASPDAC 2008»
13 years 11 months ago
Analog circuit simulation using range arithmetics
The impact of parameter variations in integrated analog circuits is usually analyzed by Monte Carlo methods with a high number of simulation runs. Few approaches based on interval ...
Darius Grabowski, Markus Olbrich, Erich Barke
ATAL
2008
Springer
13 years 11 months ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
« Prev « First page 1042 / 1209 Last » Next »