Sciweavers

635 search results - page 83 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
EMSOFT
2009
Springer
15 years 1 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ATAL
2005
Springer
15 years 3 months ago
A real-world approach to secure and trusted negotiation in MASs
The problem of providing tools to support legally valid negotiations between agents is becoming more and more critical. Agents are supposed to perform crucial tasks autonomously; ...
Roberto Bianchi, Andrea Fontana, Federico Bergenti
JELIA
2004
Springer
15 years 3 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 1 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 1 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo