7820 search results - page 359 / 1564 » Formalization of Time and Space |
201
click to vote
IADIS
2004
15 years 9 months ago
2004
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
265
click to vote
TCAD
1998
15 years 7 months ago
1998
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...
192
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
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-...
204
click to vote
SODA
2001
ACM
15 years 9 months ago
2001
ACM
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...
176
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
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...