Sciweavers

2131 search results - page 52 / 427
» A computational approximation to the AIXI model
Sort
View
CIE
2009
Springer
14 years 2 months ago
Stochastic Programs and Hybrid Automata for (Biological) Modeling
We present a technique to associate to stochastic programs written in stochastic Concurrent Constraint Programming a semantics in terms of a lattice of hybrid automata. The aim of ...
Luca Bortolussi, Alberto Policriti
ISMB
1998
13 years 9 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
GRAPHITE
2005
ACM
14 years 1 months ago
Adaptive T-spline surface fitting to z-map models
Surface fitting refers to the process of constructing a smooth representation for an object surface from a fairly large number of measured 3D data points. This paper presents an ...
Jianmin Zheng, Yimin Wang, Hock Soon Seah
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking