Sciweavers

840 search results - page 8 / 168
» The Complexity of the Extended GCD Problem
Sort
View
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
12 years 11 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
AAAI
2012
11 years 10 months ago
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf ...
CIKM
1997
Springer
13 years 12 months ago
A Framework for the Management of Past Experiences with Time-Extended Situations
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
Michel Jaczynski
PIMRC
2008
IEEE
14 years 2 months ago
A distributed extended information filter for Self-Localization in Sensor Networks
—In this paper the Self-Localization problem for Sensor Networks is addressed. Given a set of nodes deployed in an environment, self-localization consists of finding out the loc...
Andrea Gasparri, Federica Pascucci, Giovanni Ulivi
FLAIRS
2007
13 years 10 months ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek