Sciweavers

465 search results - page 69 / 93
» On the Hardness of Range Assignment Problems
Sort
View
ACNS
2010
Springer
187views Cryptology» more  ACNS 2010»
15 years 3 months ago
Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
Markus Rückert, Michael Schneider 0002, Domin...
96
Voted
SIGSOFT
2009
ACM
16 years 19 days ago
DebugAdvisor: a recommender system for debugging
In large software development projects, when a programmer is assigned a bug to fix, she typically spends a lot of time searching (in an ad-hoc manner) for instances from the past ...
B. Ashok, Joseph M. Joy, Hongkang Liang, Sriram K....
ATAL
2009
Springer
15 years 6 months ago
Stable multi-project scheduling of airport ground handling services by heterogeneous agents
This paper addresses decentralized multi-project scheduling under uncertainty. The problem instance we study is the scheduling of airport ground handling services, where aircraft ...
Xiaoyu Mao, Nico Roos, Alfons H. Salden
ARGMAS
2007
Springer
15 years 3 months ago
Arguing and Explaining Classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
Leila Amgoud, Mathieu Serrurier
IJCAI
2007
15 years 1 months ago
Document Summarization Using Conditional Random Fields
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task ...
Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, Zheng ...