Sciweavers

1671 search results - page 321 / 335
» Language Constructs for Multi-agent Programming
Sort
View
KDD
2002
ACM
184views Data Mining» more  KDD 2002»
16 years 2 months ago
The Community of Multimedia Agents
Multimedia data mining requires the ability to automatically analyze and understand the content. The Community of Multimedia Agents project is devoted to creating a community of re...
Gang Wei, Valery A. Petrushin, Anatole Gershman
ICALP
2009
Springer
16 years 2 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
ICALP
2009
Springer
16 years 2 months ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
LICS
2009
IEEE
15 years 9 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos
LICS
2007
IEEE
15 years 8 months ago
Static Name Control for FreshML
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
François Pottier