Sciweavers

1603 search results - page 29 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
IJCAI
1989
14 years 11 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
COR
2010
129views more  COR 2010»
14 years 8 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
MOR
2006
95views more  MOR 2006»
14 years 10 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ADBIS
2005
Springer
116views Database» more  ADBIS 2005»
15 years 3 months ago
A Formal Model for the Problem of View Selection for Aggregate Queries
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
AIR
2005
98views more  AIR 2005»
14 years 10 months ago
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives ...
Sheng Uei Guan, Qian Chen, Wenting Mo