Sciweavers

2680 search results - page 279 / 536
» The topology of the independence complex
Sort
View
143
Voted
DALT
2009
Springer
15 years 5 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
USS
2008
15 years 4 months ago
Administrative and Public Verifiability: Can We Have Both?
Administrative verifiability gives election officials the means to protect against certain kinds of errors and fraud. This is typically accomplished with tools like paper audit tr...
Josh Benaloh
WSC
2007
15 years 4 months ago
A simulation-based algorithm for supply chain optimization
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
Takayuki Yoshizumi, Hiroyuki Okano
PODC
2010
ACM
15 years 3 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
ECAI
2008
Springer
15 years 3 months ago
Semantic Modularity and Module Extraction in Description Logics
Abstract. The aim of this paper is to study semantic notions of modularity in description logic (DL) terminologies and reasoning problems that are relevant for modularity. We defin...
Boris Konev, Carsten Lutz, Dirk Walther, Frank Wol...