Sciweavers

1550 search results - page 98 / 310
» Optimizing search by showing results in context
Sort
View
ATAL
2010
Springer
13 years 10 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
12 years 4 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...
AI
2010
Springer
13 years 9 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
SIGIR
2004
ACM
14 years 2 months ago
Block-based web search
Multiple-topic and varying-length of web pages are two negative factors significantly affecting the performance of web search. In this paper, we explore the use of page segmentati...
Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma
EMO
2003
Springer
86views Optimization» more  EMO 2003»
14 years 2 months ago
No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
David Corne, Joshua D. Knowles