Sciweavers

8413 search results - page 270 / 1683
» Ordering Problem Subgoals
Sort
View
ECAI
2006
Springer
15 years 5 months ago
Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
Ulrich Junker, Olivier Lhomme
IPM
2007
83views more  IPM 2007»
15 years 2 months ago
Information retrieval performance measures for a current awareness report composition aid
This papers studies a special “small” information retrieval problem where user satisfaction only depends on the ordering of documents. We look for a retrieval performance meas...
Thomas Krichel
TSMC
2008
136views more  TSMC 2008»
15 years 2 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
ACL
2009
15 years 26 days ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
CEC
2008
IEEE
15 years 9 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...