Sciweavers

3221 search results - page 551 / 645
» Termination of Linear Programs
Sort
View
IJCAI
2003
15 years 7 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
STRINGOLOGY
2004
15 years 7 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 7 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...
WSC
2004
15 years 7 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...
WSC
2004
15 years 7 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