Sciweavers

1999 search results - page 81 / 400
» Dependently Typed Grammars
Sort
View
COLING
1996
15 years 7 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 7 months ago
Evolutionary swarm design of architectural idea models
In this paper we present a swarm grammar system that makes use of bio-inspired mechanisms of reproduction, communication and construction in order to build three-dimensional struc...
Sebastian von Mammen, Christian Jacob
SAC
2009
ACM
16 years 29 days ago
Dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...
Romain Rouvoy, Frank Eliassen, Mikaël Beauvoi...
SAT
2009
Springer
109views Hardware» more  SAT 2009»
16 years 22 days ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
JNW
2006
147views more  JNW 2006»
15 years 6 months ago
Dependability Considerations in Wireless Sensor Networks Applications
Recently, the use of wireless sensor networks has spread to applications areas that are not viable or costefficient to be run on other types of networks. Due to some critical tasks...
Amirhosein Taherkordi, Majid Alkaee Taleghan, Mohs...