Sciweavers

285 search results - page 47 / 57
» The complexity of soft constraint satisfaction
Sort
View
81
Voted
CCIA
2005
Springer
15 years 3 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...
76
Voted
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
15 years 2 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
PKDD
2004
Springer
155views Data Mining» more  PKDD 2004»
15 years 2 months ago
Ensemble Feature Ranking
A crucial issue for Machine Learning and Data Mining is Feature Selection, selecting the relevant features in order to focus the learning search. A relaxed setting for Feature Sele...
Kees Jong, Jérémie Mary, Antoine Cor...
AIPS
1994
14 years 10 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
AINA
2007
IEEE
15 years 3 months ago
A Flexible Scheduling Framework for Deeply Embedded Systems
— Typical embedded systems must perform rather complex control and communication tasks with severely restricted computing resources. Due to these contraints most systems are sing...
Karsten Walther, Jörg Nolte