Sciweavers

1176 search results - page 48 / 236
» Theory and Applications of Robust Optimization
Sort
View
AAAI
1996
15 years 1 months ago
Discovering Robust Knowledge from Dynamic Closed World Data
Many applications of knowledge discovery require the knowledge to be consistent with data. Examples include discovering rules for query optimization, database integration, decisio...
Chun-Nan Hsu, Craig A. Knoblock
DATAMINE
1998
106views more  DATAMINE 1998»
14 years 11 months ago
Discovering Robust Knowledge from Databases that Change
Many applications of knowledge discovery and data mining such as rule discovery for semantic query optimization, database integration and decision support, require the knowledge t...
Chun-Nan Hsu, Craig A. Knoblock
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
15 years 6 months ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius
4OR
2005
104views more  4OR 2005»
14 years 11 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer