Sciweavers

3475 search results - page 238 / 695
» Backbones in Optimization and Approximation
Sort
View
UAI
2001
15 years 8 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
CSDA
2004
105views more  CSDA 2004»
15 years 6 months ago
Computational aspects of algorithms for variable selection in the context of principal components
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 9 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
COCOA
2008
Springer
15 years 8 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
IJCAI
2007
15 years 8 months ago
RoxyBot-06: An (SAA)2 TAC Travel Agent
In this paper, we describe our entrant in the travel division of the 2006 Trading Agent Competition (TAC). At a high level, the design of many successful autonomous trading agents...
Seong Jae Lee, Amy R. Greenwald, Victor Naroditski...