Sciweavers

10493 search results - page 123 / 2099
» Dynamic Word Problems
Sort
View
CSR
2009
Springer
13 years 12 months ago
The Reachability Problem over Infinite Graphs
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
Wolfgang Thomas
DAM
2007
103views more  DAM 2007»
13 years 8 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 7 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
ICAISC
2010
Springer
14 years 24 days ago
Evaluation of a Communication Platform for Safety Critical Robotics
As the number of handicapped people increases worldwide, Intelligent Wheelchairs (IW) are becoming the solution to enable a higher degree of independence for wheelchair users. In a...
Frederico M. Cunha, Rodrigo A. M. Braga, Luí...
JWSR
2007
99views more  JWSR 2007»
13 years 8 months ago
A Metamorphic Testing Approach for Online Testing of Service-Oriented Software Applications
: Testing the correctness of services assures the functional quality of service-oriented application. A service-oriented application may bind dynamically to its supportive services...
W. Chan, S. Cheung, K. Leung