Sciweavers

11 search results - page 1 / 3
» Cut and Pay
Sort
View
JOLLI
2006
123views more  JOLLI 2006»
13 years 4 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay
FOCS
2005
IEEE
13 years 10 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
13 years 10 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
WECWIS
2003
IEEE
122views ECommerce» more  WECWIS 2003»
13 years 10 months ago
The Design and Implementation of Intelligent Transportation Web Services
This paper presents the design and implementation of an intelligent transportation web service (ITWS) and studies various QoS requirements for the web service infrastructure. In p...
Chun-Hsin Wu, Da-Chun Su, Justin Chang, Chia-Chen ...
EL
2002
134views more  EL 2002»
13 years 4 months ago
Security issues in online games
The traditional target of computer game security is mainly copy protection. The emergence of online games fundamentally changes the security requirements for computer games. Althou...
Jianxin Jeff Yan, Hyun-Jin Choi