Sciweavers

8647 search results - page 45 / 1730
» The Container Selection Problem
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
GECCO
2004
Springer
15 years 3 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
ESWS
2008
Springer
14 years 11 months ago
Combining Context Navigation with Semantic Autocompletion to Solve Problems in Concept Selection
Many tasks on the semantic web require the user to choose concepts from a limited vocabulary e.g. for describing an indexed resource or for use in semantic search. Semantic autocom...
Reetta Sinkkilä, Eetu Mäkelä, Eero ...
JCP
2008
131views more  JCP 2008»
14 years 9 months ago
Multi-Index Cooperative Mixed Strategy for Service Selection Problem in Service-Oriented Architecture
Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. Th...
Yimin Shen, Jing Zhang, Yushun Fan
ICASSP
2011
IEEE
14 years 1 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...