526 search results - page 8 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
121
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
78
Voted
ML
2002
ACM
14 years 9 months ago
2002
ACM
Additive clustering was originally developed within cognitive psychology to enable the development of featural models of human mental representation. The representational flexibili...
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...