Sciweavers

4737 search results - page 535 / 948
» The LOGIC negotiation model
Sort
View
IIE
2007
75views more  IIE 2007»
15 years 7 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen
POPL
2006
ACM
16 years 8 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
ISVC
2007
Springer
16 years 1 months ago
Building Petri Nets from Video Event Ontologies
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...
Gal Lavee, Artyom Borzin, Ehud Rivlin, Michael Rud...
LICS
2006
IEEE
16 years 1 months ago
Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Olivier Laurent, Lorenzo Tortora de Falco
ICTCS
2005
Springer
16 years 1 months ago
A Typed Semantics of Higher-Order Store and Subtyping
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
Jan Schwinghammer