114 search results - page 19 / 23 » Some Notes on Pseudo-closed Sets |
101
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
121
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
110
Voted
CCO
2001
Springer
15 years 4 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...
HPCA
1999
IEEE
15 years 4 months ago
1999
IEEE
In general-purpose microprocessors, recent trends have pushed towards 64-bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer proble...
102
Voted
ESANN
2006
15 years 1 months ago
2006
It has been proposed that chaos can serve as a reservoir providing an infinite number of dynamical states [1, 2, 3, 4, 5]. These can be interpreted as different behaviors, search a...