Sciweavers

327 search results - page 11 / 66
» Algorithms for infinite huffman-codes
Sort
View
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
15 years 5 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
170
Voted
AWPN
2008
232views Algorithms» more  AWPN 2008»
15 years 4 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
UAI
2004
15 years 4 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
SMILE
2000
Springer
15 years 6 months ago
Volumetric Warping for Voxel Coloring on an Infinite Domain
Starting with a set of calibrated photographs taken of a scene, voxel coloring algorithms reconstruct three-dimensional surface models on a finite spatial domain. In this paper, we...
Gregory G. Slabaugh, Thomas Malzbender, W. Bruce C...
123
Voted
MOR
2007
109views more  MOR 2007»
15 years 2 months ago
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
Torpong Cheevaprawatdomrong, Irwin E. Schochetman,...