Sciweavers

1380 search results - page 76 / 276
» Computing the optimal strategy to commit to
Sort
View
AAAI
2000
13 years 9 months ago
Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment
Iterative auctions have many computational advantages over sealed-bid auctions, but can present new possibilities for strategic manipulation. We propose a two-stage technique to m...
David C. Parkes, Lyle H. Ungar
ICDCS
2011
IEEE
12 years 7 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley
INFOCOM
2007
IEEE
14 years 2 months ago
Joint Optimal Channel Probing and Transmission in Collocated Wireless Networks
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
Dong Zheng, Junshan Zhang
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
14 years 2 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
IEEEPACT
2006
IEEE
14 years 1 months ago
Whole-program optimization of global variable layout
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...
Nathaniel McIntosh, Sandya Mannarswamy, Robert Hun...