Sciweavers

3913 search results - page 182 / 783
» complexity 2006
Sort
View
FCS
2006
15 years 5 months ago
Negative-Weight Cycle Algorithms
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
Xiuzhen Huang
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
15 years 4 months ago
Decentralized control of cooperative robots without velocity-force measurements
: One of the main practical problems on cooperative robots is the complexity of integrating a large amount of expensive velocity/force sensors. In this paper, the control of cooper...
Juan C. Martínez-Rosas, Marco A. Arteaga, A...
BMCBI
2006
87views more  BMCBI 2006»
15 years 4 months ago
XML schemas for common bioinformatic data types and their application in workflow systems
Background: Today, there is a growing need in bioinformatics to combine available software tools into chains, thus building complex applications from existing single-task tools. T...
Philipp N. Seibel, Jan Krüger, Sven Hartmeier...
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 4 months ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
CORR
2006
Springer
131views Education» more  CORR 2006»
15 years 4 months ago
Sequences with constant number of return words
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
Lubomíra Balková, Edita Pelantov&aac...