Sciweavers

4218 search results - page 291 / 844
» Complete sets of cooperations
Sort
View
ICRA
2010
IEEE
163views Robotics» more  ICRA 2010»
15 years 4 months ago
Exploiting domain knowledge in planning for uncertain robot systems modeled as POMDPs
Abstract— We propose a planning algorithm that allows usersupplied domain knowledge to be exploited in the synthesis of information feedback policies for systems modeled as parti...
Salvatore Candido, James C. Davidson, Seth Hutchin...
ESWA
2010
105views more  ESWA 2010»
15 years 3 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...
RSA
2011
157views more  RSA 2011»
15 years 1 months ago
The cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
Colin Cooper, Alan M. Frieze
PLDI
2012
ACM
13 years 8 months ago
Concurrent data representation synthesis
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
AAAI
1998
15 years 7 months ago
Leveled Commitment Contracts with Myopic and Strategic Agents
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agent...
Martin Andersson, Tuomas Sandholm