Sciweavers

3656 search results - page 146 / 732
» Compact Location Problems
Sort
View
EWCBR
2000
Springer
15 years 4 months ago
Remembering Why to Remember: Performance-Guided Case-Base Maintenance
An important focus of recent CBR research is on how to develop strategies for achieving compact, competent case-bases, as a way to improve the performance of CBR systems. However, ...
David B. Leake, David C. Wilson
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 1 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
MP
2010
92views more  MP 2010»
14 years 7 months ago
Single item lot-sizing with non-decreasing capacities
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
Yves Pochet, Laurence A. Wolsey
107
Voted
COR
2007
143views more  COR 2007»
15 years 1 months ago
A memetic algorithm for channel assignment in wireless FDMA systems
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
Sung-Soo Kim, Alice E. Smith, Jong-Hyun Lee
202
Voted
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 2 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu