Sciweavers

228 search results - page 35 / 46
» Two Normal Forms for Rewriting P Systems
Sort
View
IROS
2008
IEEE
104views Robotics» more  IROS 2008»
14 years 4 months ago
Generalizing metamodules to simplify planning in modular robotic systems
— In this paper we develop a theory of metamodules and an associated distributed asynchronous planner which generalizes previous work on metamodules for lattice-based modular rob...
Daniel J. Dewey, Michael P. Ashley-Rollman, Michae...
JCC
2011
87views more  JCC 2011»
13 years 4 months ago
Determining equilibrium constants for dimerization reactions from molecular dynamics simulations
Abstract: With today’s available computer power, free energy calculations from equilibrium molecular dynamics simulations “via counting” become feasible for an increasing num...
Djurre H. De Jong, Lars V. Schäfer, Alex H. D...
ICTCS
2003
Springer
14 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
APCSAC
2001
IEEE
14 years 1 months ago
Stacking them up: a Comparison of Virtual Machines
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
K. John Gough
EXACT
2007
13 years 12 months ago
A Discourse Approach to Explanation Aware Knowledge Representation
This study describes a discourse approach to explanation aware knowledge representation. It presents a reasoning model that adheres to argumentation as found in written discourse,...
Andrew Potter