4981 search results - page 948 / 997 » Dependent Gaussian Processes |
CEC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
106
click to vote
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
181
click to vote
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
Through adjustable autonomy (AA), an agent can dynamically vary the degree to which it acts autonomously, allowing it to exploit human abilities to improve its performance, but wi...
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
127
click to vote
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...