Sciweavers

2044 search results - page 204 / 409
» System theory for numerical analysis
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2008
Springer
15 years 8 months ago
Towards agents participating in realistic multi-unit sealed-bid auctions
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditiona...
Ioannis A. Vetsikas, Nicholas R. Jennings
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 6 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
MOBIHOC
2008
ACM
16 years 6 months ago
Cooperative transmit-power estimation under wireless fading
We study blind estimation of transmission power of a node based on received power measurements obtained under wireless fading. Specifically, the setup consists of a set of monitor...
Murtaza Zafer, Bongjun Ko, Ivan Wang Hei Ho
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said