Sciweavers

1548 search results - page 65 / 310
» Computational Approaches to Sentence Completion
Sort
View
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
15 years 6 months ago
A convex approach to the characterization of the frequency response of ellipsoidal plants
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
Graziano Chesi, Andrea Garulli, Alberto Tesi, Anto...
ICSOC
2010
Springer
15 years 4 months ago
A Soft Constraint-Based Approach to QoS-Aware Service Selection
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
Mohamed Anis Zemni, Salima Benbernou, Manuel Carro
GI
1999
Springer
15 years 10 months ago
Combining Strict and Soft Typing in Functional Programming
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...
Manfred Widera, Christoph Beierle
KR
1998
Springer
15 years 10 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
NLP
2000
15 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman