Sciweavers

1220 search results - page 59 / 244
» Restricting grammatical complexity
Sort
View
STACS
2010
Springer
15 years 9 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon
WSTST
2005
Springer
15 years 7 months ago
Massive Multi-Agent Simulation in 3D
: In this paper, we discuss our challenge on how to give the creatures and ability to follow spatial restriction while keeping the complexity low enough to still allow for real-tim...
Masaru Aoyagi, Akira Namatame
ATAL
2001
Springer
15 years 6 months ago
Evolving Real-Time Local Agent Control for Large-Scale Multi-agent Systems
Abstract. Control for agents situated in multi-agent systems is a complex problem. This is particularly true in hard, open, dynamic environments where resource, privacy, bandwidth,...
Thomas Wagner, Victor R. Lesser
PODS
1991
ACM
93views Database» more  PODS 1991»
15 years 5 months ago
The Expressiveness of a Family of Finite Set Languages
In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified framework for queries and updates. By imposing simple s...
Neil Immerman, Sushant Patnaik, David W. Stemple
IJON
2011
169views more  IJON 2011»
14 years 9 months ago
Exploiting local structure in Boltzmann machines
Restricted Boltzmann Machines (RBM) are well-studied generative models. For image data, however, standard RBMs are suboptimal, since they do not exploit the local nature of image ...
Hannes Schulz, Andreas Müller 0004, Sven Behn...