Sciweavers

2244 search results - page 142 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
WSC
2008
15 years 8 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
IJCAI
2007
15 years 7 months ago
A Hybrid Ontology Directed Feedback Selection Algorithm for Supporting Creative Problem Solving Dialogues
We evaluate a new hybrid language processing approach designed for interactive applications that maintain an interaction with users over multiple turns. Specifically, we describe ...
Hao-Chuan Wang, Rohit Kumar, Carolyn Penstein Ros&...
ANOR
2011
175views more  ANOR 2011»
15 years 1 months ago
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
Fred Glover, Lawrence H. Cox, Rahul Patil, James P...
QSHINE
2005
IEEE
15 years 12 months ago
Link Scheduling with Power Control for Throughput Enhancement in Multihop Wireless Networks
Abstract— Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusi...
Jian Tang, Guoliang Xue, Christopher Chandler, Wei...
GECCO
2000
Springer
156views Optimization» more  GECCO 2000»
15 years 10 months ago
Optimal Mutation Rates and Selection Pressure in Genetic Algorithms
It has been argued that optimal per-locus mutation rates in GAs are proportional to selection pressure and the reciprocal of genotype length. In this paper we suggest that the not...
Gabriela Ochoa, Inman Harvey, Hilary Buxton