Sciweavers

3221 search results - page 595 / 645
» Termination of Linear Programs
Sort
View
UAI
1997
15 years 7 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
ATAL
2010
Springer
15 years 7 months ago
Formalizing organizational constraints: a semantic approach
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
ALMOB
2006
138views more  ALMOB 2006»
15 years 6 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
15 years 6 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...
BMCBI
2006
134views more  BMCBI 2006»
15 years 6 months ago
A statistical score for assessing the quality of multiple sequence alignments
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...
Virpi Ahola, Tero Aittokallio, Mauno Vihinen, Esa ...