Sciweavers

2543 search results - page 298 / 509
» Optimal Ordered Problem Solver
Sort
View
CEC
2007
IEEE
15 years 7 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 7 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
FSS
2008
89views more  FSS 2008»
15 years 1 months ago
On the equivalence of some approaches to the OWA operator and RIM quantifier determination
The ordered weighted averaging (OWA) operator is a widely used aggregation method, and its determination is usually a prerequisite step in many related applications. The regular i...
Xinwang Liu, Hongwei Lou
DAM
2006
132views more  DAM 2006»
15 years 1 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
IJRR
2008
139views more  IJRR 2008»
15 years 29 days ago
Learning to Control in Operational Space
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
Jan Peters, Stefan Schaal