Sciweavers

197 search results - page 22 / 40
» Efficient Inference of Partial Types
Sort
View
AAAI
2010
13 years 8 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
EMSOFT
2004
Springer
14 years 4 days ago
Towards a higher-order synchronous data-flow language
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
Jean-Louis Colaço, Alain Girault, Gré...
CCR
2008
85views more  CCR 2008»
13 years 6 months ago
On cycles in AS relationships
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
Xenofontas A. Dimitropoulos, M. Ángeles Ser...
NIPS
2008
13 years 8 months ago
Recursive Segmentation and Recognition Templates for 2D Parsing
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
Leo Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan ...
POPL
2003
ACM
14 years 7 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost