294 search results - page 59 / 59 » The complexity of computing a Nash equilibrium |
INFORMS
1998
13 years 5 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
OOPSLA
2009
Springer
14 years 4 days ago
2009
Springer
Software correctness has bedeviled the field of computer science since its inception. Software complexity has increased far more quickly than our ability to control it, reaching ...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...