Sciweavers

293 search results - page 53 / 59
» Optimal Integer Alphabetic Trees in Linear Time
Sort
View
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
EOR
2007
272views more  EOR 2007»
13 years 7 months ago
A dynamic logistics coordination model for evacuation and support in disaster response activities
This paper describes an integrated location-distribution model for coordinating logistics support and evacuation operations in disaster response activities. Logistics planning in ...
Wei Yi, Linet Özdamar
EMSOFT
2006
Springer
13 years 11 months ago
New approach to architectural synthesis: incorporating QoS constraint
Embedded applications like video decoding, video streaming and those in the network domain, typically have a Quality of Service (QoS) requirement which needs to be met. Apart from...
Harsh Dhand, Basant Kumar Dwivedi, M. Balakrishnan
LCN
2006
IEEE
14 years 1 months ago
Protecting Multicast Sessions in Wireless Mesh Networks
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha
AI
2011
Springer
13 years 2 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm