Sciweavers

2497 search results - page 383 / 500
» Requirements for models of achievable routing
Sort
View
107
Voted
SIGMETRICS
2006
ACM
128views Hardware» more  SIGMETRICS 2006»
15 years 7 months ago
GPS scheduling: selection of optimal weights and comparison with strict priorities
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two tra...
Pascal Lieshout, Michel Mandjes, Sem C. Borst
142
Voted
MIDDLEWARE
2005
Springer
15 years 7 months ago
Distributed collaboration for event detection in wireless sensor networks
With the advancement of technology in micro-electronics and wireless communication, small miniature devices called sensor nodes can be used to perform various tasks by forming the...
A. V. U. Phani Kumar, Adi Mallikarjuna Reddy V, D....
102
Voted
BMCBI
2007
133views more  BMCBI 2007»
15 years 1 months ago
An efficient pseudomedian filter for tiling microrrays
Background: Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elu...
Thomas E. Royce, Nicholas Carriero, Mark B. Gerste...
JAIR
2008
104views more  JAIR 2008»
15 years 1 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
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 1 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...