Sciweavers

8647 search results - page 275 / 1730
» The Container Selection Problem
Sort
View
SOFSEM
2004
Springer
15 years 9 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
108
Voted
EDBTW
2010
Springer
15 years 9 months ago
The view update problem for XML
We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that ...
Slawek Staworko, Iovka Boneva, Benoît Groz
CPAIOR
2006
Springer
15 years 7 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
141
Voted
ICIA
2007
15 years 6 months ago
A Decision-Theoretic Model of Assistance - Evaluation, Extensions and Open Problems
There is a growing interest in intelligent assistants for a variety of applications from organizing tasks for knowledge workers to helping people with dementia. In our earlier wor...
Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli...
AIR
2005
98views more  AIR 2005»
15 years 3 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