Sciweavers

118 search results - page 8 / 24
» On Approximating the Number of Relevant Variables in a Funct...
Sort
View
CSDA
2011
14 years 4 months ago
Approximate forward-backward algorithm for a switching linear Gaussian model
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
Hugo Hammer, Håkon Tjelmeland
MST
2010
140views more  MST 2010»
14 years 7 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
EMSOFT
2004
Springer
15 years 2 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 2 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
ICCD
1991
IEEE
65views Hardware» more  ICCD 1991»
15 years 1 months ago
Self-Timed Logic Using Current-Sensing Completion Detection (CSCD)
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
Mark E. Dean, David L. Dill, Mark Horowitz