Sciweavers

4004 search results - page 6 / 801
» How Many Packets Can We Encode
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Nuclei: GPU-Accelerated Many-Core Network Coding
—While it is a well known result that network coding achieves optimal flow rates in multicast sessions, its potential for practical use has remained to be a question, due to its...
Hassan Shojania, Baochun Li, Xin Wang
IJCAI
2003
13 years 10 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...
IAT
2009
IEEE
14 years 3 months ago
Extending Alternating-Offers Bargaining in One-to-Many and Many-to-Many Settings
Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studie...
Bo An, Nicola Gatti, Victor R. Lesser
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
14 years 2 months ago
How OEMs and suppliers can face the network integration challenges
Systems integration is a major challenge in many industries. Systematic analysis of the complex integration effects, especially with respect to timing and performance, significant...
Kai Richter, Rolf Ernst
ICALP
2005
Springer
14 years 2 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen