Sciweavers

1242 search results - page 244 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
EMSOFT
2009
Springer
13 years 10 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
2006
Springer
13 years 10 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...
ISER
1995
Springer
100views Robotics» more  ISER 1995»
13 years 10 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
COMPGEOM
2005
ACM
13 years 8 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 8 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer