Sciweavers

542 search results - page 86 / 109
» A Theoretical Analysis of Gene Selection
Sort
View
GEM
2007
13 years 10 months ago
Initial Population for Genetic Algorithms: A Metric Approach
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
Pedro A. Diaz-Gomez, Dean F. Hougen
EC
2007
167views ECommerce» more  EC 2007»
13 years 9 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
JIFS
2007
115views more  JIFS 2007»
13 years 9 months ago
Winner determination for combinatorial auctions for tasks with time and precedence constraints
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
Güleser K. Demir, Maria L. Gini
JECR
2002
107views more  JECR 2002»
13 years 8 months ago
Existing Business Models for Auctions and their Adaptation to Electronic Markets
In this paper we report an extensive analysis of the different business models for auctions found on the Web. Three hundred websites randomly selected from the main search engines...
Enrique Dans
INFOCOM
2010
IEEE
13 years 7 months ago
Designing a Practical Access Point Association Protocol
—In a Wireless Local Area Network (WLAN), the Access Point (AP) selection of a client heavily influences the performance of its own and others. Through theoretical analysis, we ...
Fengyuan Xu, Chiu Chiang Tan, Qun Li, Guanhua Yan,...