Sciweavers

1174 search results - page 171 / 235
» Derivation of Characteristic Formulae
Sort
View
TON
2002
75views more  TON 2002»
15 years 5 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
RSA
2008
123views more  RSA 2008»
15 years 5 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
JAIR
2010
167views more  JAIR 2010»
15 years 4 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
JCC
2011
87views more  JCC 2011»
15 years 1 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...
TASE
2010
IEEE
15 years 1 months ago
Analytic Calculus of Response Time in Networked Automation Systems
--This paper presents a novel approach to evaluate the response time in networked automation systems (NAS) that use a client/server protocol. The developments introduced are derive...
Boussad Addad, Said Amari, Jean-Jacques Lesage