Sciweavers

1453 search results - page 176 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Online adaptive clustering in a decision tree framework
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
Jayanta Basak
IAT
2005
IEEE
14 years 2 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
EPS
1998
Springer
14 years 1 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph
EURODAC
1995
IEEE
130views VHDL» more  EURODAC 1995»
14 years 26 days ago
Scalable performance scheduling for hardware-software cosynthesis
The paper presents a static process schedulingapproach as a front-end to hardware-software cosynthesis of small embedded systems which allows global system optimization. Unlike ea...
Thomas Benner, Rolf Ernst, Achim Österling
TCS
2008
13 years 9 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi