Sciweavers

70 search results - page 7 / 14
» Improved Cost Function in the Design of Boolean Functions Sa...
Sort
View
WWW
2001
ACM
14 years 8 months ago
Rank aggregation methods for the Web
We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking...
Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
14 years 22 days ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...
JSAC
2011
176views more  JSAC 2011»
13 years 2 months ago
Cross-Layer Routing Using Cooperative Transmission in Vehicular Ad-hoc Networks
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...
Zhiguo Ding, Kin K. Leung
AAAI
1997
13 years 8 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy