Sciweavers

420 search results - page 49 / 84
» Some Algorithmic Problems in Polytope Theory
Sort
View
DAC
2005
ACM
15 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
GECCO
2006
Springer
158views Optimization» more  GECCO 2006»
15 years 1 months ago
Properties of symmetric fitness functions
The properties of symmetric fitness functions are investigated. We show that a well-known encoding scheme inducing symmetric functions has the non-synonymous property and the sear...
Sung-Soon Choi, Yung-Keun Kwon, Byung Ro Moon
WWW
2008
ACM
15 years 10 months ago
Externalities in online advertising
Most models for online advertising assume that an advertiser's value from winning an ad auction, which depends on the clickthrough rate or conversion rate of the advertisemen...
Arpita Ghosh, Mohammad Mahdian
ATAL
2008
Springer
14 years 11 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
CVPR
2005
IEEE
15 years 11 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...