Sciweavers

1220 search results - page 229 / 244
» Restricting grammatical complexity
Sort
View
125
Voted
EMSOFT
2009
Springer
15 years 5 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
108
Voted
ATAL
2006
Springer
15 years 5 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
15 years 5 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
117
Voted
FOCS
2004
IEEE
15 years 5 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
EMISA
2006
Springer
15 years 5 months ago
On Design Principles for Realizing Adaptive Service Flows with BPEL
Abstract: Web service technology offers a promising approach for realizing enterprisewide and cross-organizational business applications. With the Business Process Execution Langua...
Manfred Reichert, Stefanie Rinderle