1091 search results - page 10 / 219 » On the temporal dimension of search |
101
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
103
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
101
click to vote
EDBT
1998
ACM
15 years 5 months ago
1998
ACM
An importantuse of data warehousing is to provide temporal views over the history of source data that may itself be non-temporal. While recent work in view maintenance is applicab...
154
click to vote
ESWS
2009
Springer
14 years 11 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
114
click to vote
AIPS
2009
15 years 2 months ago
2009
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...