Sciweavers

4041 search results - page 311 / 809
» time 2009
Sort
View
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
16 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
AMT
2009
Springer
116views Multimedia» more  AMT 2009»
16 years 1 months ago
Unifying Web-Scale Search and Reasoning from the Viewpoint of Granularity
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
Yi Zeng, Yan Wang, Zhisheng Huang, Ning Zhong
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
16 years 1 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
ASIACRYPT
2009
Springer
16 years 1 months ago
Related-Key Cryptanalysis of the Full AES-192 and AES-256
In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has 299.5 time and data complex...
Alex Biryukov, Dmitry Khovratovich
BPM
2009
Springer
140views Business» more  BPM 2009»
16 years 1 months ago
Mobile Workforce Scheduling Problem with Multitask-Processes
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
Asvin Goel, Volker Gruhn, Thomas Richter