Sciweavers

173 search results - page 30 / 35
» Incremental algorithms for dispatching in dynamically typed ...
Sort
View
AIPS
2009
13 years 9 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
EMNLP
2010
13 years 5 months ago
Top-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly ...
Eugene Charniak
PDPTA
2007
13 years 9 months ago
Communication with Super Flexible Messaging
Abstract Super Flexible Messaging (SFM) provides a powerful and elegant message passing abstraction for transferring arbitrary data between remote processes. SFM achieves the simpl...
Alexey Fedosov, Gregory Benson
JFP
2006
78views more  JFP 2006»
13 years 7 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
COOPIS
2003
IEEE
14 years 1 months ago
Analysing Mailboxes of Asynchronous Communicating Components
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...
Jean-Claude Royer, Michael Xu