Sciweavers

82 search results - page 8 / 17
» Automatic Derivation of Compositional Rules in Automated Com...
Sort
View
EACL
1993
ACL Anthology
13 years 10 months ago
LFG Semantics via Constraints
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the me...
Mary Dalrymple, John Lamping, Vijay A. Saraswat
WWW
2008
ACM
14 years 9 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
ECRTS
2007
IEEE
14 years 2 months ago
A Delay Composition Theorem for Real-Time Pipelines
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
Praveen Jayachandran, Tarek F. Abdelzaher
ENTCS
2008
153views more  ENTCS 2008»
13 years 8 months ago
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
Johan Dovland, Einar Broch Johnsen, Olaf Owe
EC
2008
146views ECommerce» more  EC 2008»
13 years 8 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga