1290 search results - page 216 / 258 » Popular Matchings: Structure and Algorithms |
158
click to vote
WDAG
2005
Springer
15 years 11 months ago
2005
Springer
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
175
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
176
click to vote
APPROX
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
183
click to vote
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Consider an online ad campaign run by an advertiser. The ad serving companies that handle such campaigns record users' behavior that leads to impressions of campaign ads, as ...
166
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...