Sciweavers

62 search results - page 12 / 13
» The Ackermann functions are not optimal, but by how much
Sort
View
JAIR
2008
104views more  JAIR 2008»
13 years 5 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes
ICDE
2011
IEEE
194views Database» more  ICDE 2011»
12 years 9 months ago
Representative skylines using threshold-based preference distributions
— The study of skylines and their variants has received considerable attention in recent years. Skylines are essentially sets of most interesting (undominated) tuples in a databa...
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, R...
BMCBI
2010
104views more  BMCBI 2010»
13 years 5 months ago
Parameters for accurate genome alignment
Background: Genome sequence alignments form the basis of much research. Genome alignment depends on various mundane but critical choices, such as how to mask repeats and which sco...
Martin C. Frith, Michiaki Hamada, Paul Horton
MOBIHOC
2005
ACM
14 years 5 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 4 days ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang