Sciweavers

7167 search results - page 845 / 1434
» Answer Set Programming
Sort
View
AIEDU
2007
108views more  AIEDU 2007»
15 years 6 months ago
Explicit Reflection in Prolog-Tutor
This paper describes a reflection-based approach for open learner modeling (OLM). Tutoring dialogues are used by learners to explicitly reveal their own knowledge state to themselv...
Joséphine M. P. Tchétagni, Roger Nka...
ANOR
2007
73views more  ANOR 2007»
15 years 6 months ago
A sample-path approach to optimal position liquidation
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
Pavlo A. Krokhmal, Stan Uryasev
AUTOMATICA
2007
72views more  AUTOMATICA 2007»
15 years 6 months ago
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Giuseppe C. Calafiore, Fabrizio Dabbene
BMCBI
2010
124views more  BMCBI 2010»
15 years 6 months ago
A Dynamic Noise Level Algorithm for Spectral Screening of Peptide MS/MS Spectra
Background: High-throughput shotgun proteomics data contain a significant number of spectra from non-peptide ions or spectra of too poor quality to obtain highly confident peptide...
Hua Xu, Michael A. Freitas
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...