Sciweavers

5350 search results - page 197 / 1070
» Space and time in eco-ontologies
Sort
View
TCAD
1998
154views more  TCAD 1998»
15 years 6 months ago
Address generation for memories containing multiple arrays
This paper presents techniques for generating addresses for memories containing multiple arrays. Because these techniques rely on the inversion or rearrangement of address bits, t...
Herman Schmit, Donald E. Thomas
FORMATS
2010
Springer
15 years 4 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
16 years 22 days ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 8 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 6 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...