Sciweavers

16404 search results - page 2406 / 3281
» A set coverage problem
Sort
View
PUK
2000
15 years 9 months ago
Scheduling in a Planning Environment
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan....
Antonio Garrido Tejero, Miguel A. Salido, Federico...
SWAP
2007
15 years 8 months ago
Reasoning with Instances of Heterogeneous Ontologies
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
Luciano Serafini, Andrei Tamilin
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 8 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
ICFP
2010
ACM
15 years 8 months ago
Matching lenses: alignment and view update
Bidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy--i.e.,...
Davi M. J. Barbosa, Julien Cretin, Nate Foster, Mi...
« Prev « First page 2406 / 3281 Last » Next »