2168 search results - page 273 / 434 » Randomized Algorithms and Complexity Theory |
111
Voted
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
143
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
132
Voted
AC
2004
Springer
15 years 3 months ago
2004
Springer
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by auto...
160
click to vote
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
145
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...