Sciweavers

16666 search results - page 4 / 3334
» Descriptive and Computational Complexity
Sort
View
75
Voted
HPDC
1999
IEEE
15 years 3 months ago
A Resource Description Environment for Distributed Computing Systems
RSD (Resource and Service Description) is a software architecture for specifying, registering and accessing resources and services in complex heterogeneous computing environments....
Matthias Brune, Alexander Reinefeld, Jörg Var...
100
Voted
GMP
2006
IEEE
118views Solid Modeling» more  GMP 2006»
15 years 5 months ago
Computing a Family of Skeletons of Volumetric Models for Shape Description
Skeletons are important shape descriptors in object representation and recognition. Typically, skeletons of volumetric models are computed using iterative thinning. However, tradi...
Tao Ju, Matthew L. Baker, Wah Chiu
ACL
1990
15 years 2 days ago
The Computational Complexity of Avoiding Conversational Implicatures
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
Ehud Reiter
67
Voted
BSL
2008
97views more  BSL 2008»
14 years 11 months ago
The Complexity of Orbits of Computably Enumerable Sets
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, E, such that the question of membership in this orbit is 1 1-complete. This result an...
Peter Cholak, Rodney G. Downey, Leo Harrington
105
Voted
DALT
2009
Springer
15 years 2 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...