Sciweavers

2266 search results - page 407 / 454
» Some Solutions to the Ignoring Problem
Sort
View
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
15 years 11 months ago
Bringing evolutionary computation to industrial applications with guide
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
Luís Da Costa, Marc Schoenauer
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
ICDM
2007
IEEE
227views Data Mining» more  ICDM 2007»
15 years 11 months ago
Optimal Subsequence Bijection
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
Longin Jan Latecki, Qiang Wang, Suzan Koknar-Tezel...
INFOCOM
2006
IEEE
15 years 10 months ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
SPAA
2004
ACM
15 years 10 months ago
Pagoda: a dynamic overlay network for routing, data management, and multicasting
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
Ankur Bhargava, Kishore Kothapalli, Chris Riley, C...