Sciweavers

692 search results - page 68 / 139
» Why Experimentation can be better than
Sort
View
116
Voted
KR
2004
Springer
15 years 7 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
WAC
2004
Springer
122views Communications» more  WAC 2004»
15 years 7 months ago
Dynamic Self-management of Autonomic Systems: The Reputation, Quality and Credibility (RQC) Scheme
In this paper, we present a feedback-based system for managing trust and detecting malicious behavior in autonomically behaving networks. Like other distributed trust management sy...
Anurag Garg, Roberto Battiti, Gianni Costanzi
SAC
2003
ACM
15 years 6 months ago
Improving Image Retrieval Effectiveness in Query-by-Example Environment
Query-by-example is the most popular query model for today’s image retrieval systems. A typical query image contains not only relevant objects (e.g., Eiffel Tower), but also ir...
Khanh Vu, Kien A. Hua, Ning Jiang
AMEC
2003
Springer
15 years 6 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
APCCAS
2002
IEEE
156views Hardware» more  APCCAS 2002»
15 years 6 months ago
Bit-plane watermarking for zerotree-coded images
In this paper, we develop a robust bit-plane watermarking technique based on zerotree coding. A robust watermark is an imperceptible but indelible code that can be used for owners...
Shih-Hsuan Yang, Hsin-Chang Chen