Sciweavers

77 search results - page 3 / 16
» Probabilistic Possible Winner Determination
Sort
View
DEXAW
2004
IEEE
88views Database» more  DEXAW 2004»
15 years 1 months ago
A Possible World Approach to Uncertain Relational Data
Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data ca...
Ander de Keijzer, Maurice van Keulen
AAAI
2012
13 years 5 days ago
The Price of Neutrality for the Ranked Pairs Method
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
Markus Brill, Felix A. Fischer
DC
2007
14 years 9 months ago
Randomized leader election
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
Murali Krishna Ramanathan, Ronaldo A. Ferreira, Su...
ISCAS
2007
IEEE
117views Hardware» more  ISCAS 2007»
15 years 4 months ago
Quantifying Input and Output Spike Statistics of a Winner-Take-All Network in a Vision System
— Event-driven spike-based processing systems offer new possibilities for real-time vision. Signals are encoded asynchronously in time thus preserving the time information of the...
Matthias Oster, Rodney J. Douglas, Shih-Chii Liu
IAT
2006
IEEE
15 years 3 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...