Sciweavers

952 search results - page 115 / 191
» Computational complexity of stochastic programming problems
Sort
View
AAAI
2006
15 years 4 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos
ALMOB
2006
113views more  ALMOB 2006»
15 years 3 months ago
Inverse bifurcation analysis: application to simple gene systems
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
James Lu, Heinz W. Engl, Peter Schuster
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 5 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
PODC
2005
ACM
15 years 8 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
ICALP
2007
Springer
15 years 9 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz