Sciweavers

2636 search results - page 412 / 528
» Linear Programming
Sort
View
118
Voted
STRINGOLOGY
2004
15 years 3 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
UAI
2004
15 years 3 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
110
Voted
WSC
2004
15 years 3 months ago
Stream Option Manager
Stream Option Manager (SOM) is a set of mathematical tools developed at The MITRE Corporation's Center for Advanced Aviation System Development (CAASD). While still under dev...
William P. Niedringhaus, Michael J. White, Patrick...
113
Voted
WSC
2004
15 years 3 months ago
Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, i...
Hans Vangheluwe, Juan de Lara
127
Voted
NIPS
2003
15 years 3 months ago
Sparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari, Se...