Sciweavers

1380 search results - page 239 / 276
» Computing the optimal strategy to commit to
Sort
View
IWQOS
2005
Springer
14 years 1 months ago
A High-Throughput Overlay Multicast Infrastructure with Network Coding
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
Mea Wang, Zongpeng Li, Baochun Li
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
NPC
2004
Springer
14 years 1 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 1 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
14 years 1 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...