Sciweavers

2266 search results - page 106 / 454
» Some Solutions to the Ignoring Problem
Sort
View
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 5 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
ICML
2009
IEEE
16 years 2 months ago
Constraint relaxation in approximate linear programs
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
Marek Petrik, Shlomo Zilberstein
GRID
2000
Springer
15 years 5 months ago
An Advanced User Interface Approach for Complex Parameter Study Process Specification on the Information Power Grid
The creation of parameter study suites has recently become a more challenging problem as the parameter studies have become multi-tiered and the computational environment has becom...
Maurice Yarrow, Karen M. McCann, Rupak Biswas, Rob...
EXPERT
2007
109views more  EXPERT 2007»
15 years 1 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...
JAIR
2010
115views more  JAIR 2010»
14 years 12 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech