Sciweavers

1912 search results - page 268 / 383
» On the evaluation of argumentation formalisms
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 4 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
INFOCOM
2010
IEEE
15 years 4 months ago
INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding
—Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called netwo...
Tingting Chen, Sheng Zhong
JELIA
2010
Springer
15 years 4 months ago
Decomposition of Distributed Nonmonotonic Multi-Context Systems
Multi-Context Systems (MCS) are formalisms that enable the interlinkage of single knowledge bases, called contexts, via bridge rules. Recently, the evaluation of heterogeneous, no...
Seif El-Din Bairakdar, Minh Dao-Tran, Thomas Eiter...
PVLDB
2010
98views more  PVLDB 2010»
15 years 4 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...
ASIACRYPT
2010
Springer
15 years 4 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg