Sciweavers

5019 search results - page 205 / 1004
» Computing in Quotient Groups
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
ACS
2007
15 years 6 months ago
Components of the Fundamental Category II
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
Eric Goubault, Emmanuel Haucourt
ENTCS
2008
103views more  ENTCS 2008»
15 years 6 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
GROUP
2003
ACM
15 years 11 months ago
Awareness support in a groupware widget toolkit
Group awareness is an important part of synchronous collaboration, and support for group awareness can greatly improve groupware usability. However, it is still difficult to build...
Jason Hill, Carl Gutwin
CEC
2007
IEEE
15 years 10 months ago
Double-deck elevator systems using Genetic Network Programming with reinforcement learning
Abstract-- In order to increase the transportation capability of elevator group systems in high-rise buildings without adding elevator installation space, double-deck elevator syst...
Jin Zhou, Lu Yu, Shingo Mabu, Kotaro Hirasawa, Jin...