Sciweavers

11151 search results - page 1850 / 2231
» On the Complexity of Model Expansion
Sort
View
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
16 years 1 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
AMI
2009
Springer
16 years 1 months ago
I Bet You Look Good on the Wall: Making the Invisible Computer Visible
The design ideal of the invisible computer, prevalent in the vision of ambient intelligence (AmI), has led to a number of interaction challenges. The complex nature of AmI environm...
Jo Vermeulen, Jonathan Slenders, Kris Luyten, Kari...
APN
2009
Springer
16 years 1 months ago
Monotonicity in Service Orchestrations
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given Quality of Service (QoS...
Anne Bouillard, Sidney Rosario, Albert Benveniste,...
APPT
2009
Springer
16 years 1 months ago
Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox
In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance...
Christoph Bosshard, Roland Bouffanais, Christian C...
WG
2009
Springer
16 years 1 months ago
Distance d-Domination Games
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
Stephan Kreutzer, Sebastian Ordyniak
« Prev « First page 1850 / 2231 Last » Next »