Sciweavers

21324 search results - page 463 / 4265
» Making the case for computing
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 4 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
ATAL
2005
Springer
16 years 17 days ago
Sequential auctions for objects with common and private values
Sequential auctions are an important mechanism for buying/selling multiple objects. Existing work has studied sequential auctions for objects that are exclusively either common va...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
CASES
2004
ACM
16 years 14 days ago
Hardware assisted control flow obfuscation for embedded processors
+ With more applications being deployed on embedded platforms, software protection becomes increasingly important. This problem is crucial on embedded systems like financial transa...
Xiaotong Zhuang, Tao Zhang, Hsien-Hsin S. Lee, San...
CISIS
2010
IEEE
16 years 10 days ago
Resilient Critical Infrastructure Management Using Service Oriented Architecture
—The SERSCIS project aims to support the use of interconnected systems of services in Critical Infrastructure (CI) applications. The problem of system interconnectedness is aptly...
Martin Hall-May, Mike Surridge
KES
1999
Springer
15 years 11 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli