Sciweavers

1433 search results - page 127 / 287
» On Covering Problems of Rado
Sort
View
RANDOM
2001
Springer
15 years 11 months ago
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
Reuven Bar-Yehuda, Dror Rawitz
ICLP
1995
Springer
15 years 10 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle
CAV
2008
Springer
143views Hardware» more  CAV 2008»
15 years 8 months ago
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem v...
Salil Joshi, Barbara König
HCI
2007
15 years 8 months ago
An MDE-SOA Approach to Support Plastic User Interfaces in Ambient Spaces
User interface (UI) plasticity denotes UI adaptation to the context of use (user, platform, physical and social environment) while preserving usability. Our approach to this proble...
Joëlle Coutaz, Lionel Balme, X. Alvaro, Ga&eu...
EACL
2003
ACL Anthology
15 years 8 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren