Sciweavers

272 search results - page 52 / 55
» Programming languages capturing complexity classes
Sort
View
EXPERT
2006
84views more  EXPERT 2006»
15 years 4 months ago
Infrastructure for Engineered Emergence on Sensor/Actuator Networks
abstraction rules that hide the complexity of systems of components. We've begun this process in the domain of sensor/actuator network applications, observing that in manyappl...
Jacob Beal, Jonathan Bachrach
EMSOFT
2009
Springer
15 years 8 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
ICALP
2003
Springer
15 years 9 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
DOCENG
2006
ACM
15 years 10 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
DAC
2005
ACM
16 years 5 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir