Sciweavers

692 search results - page 77 / 139
» Some research questions for computational transportation sci...
Sort
View
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 1 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
RSEISP
2007
Springer
15 years 4 months ago
Web-Based Support Systems with Rough Set Analysis
Abstract. Rough sets have been applied to many areas where multiattribute data is needed to be analyzed to acquire knowledge for decision making. Web-based Support Systems (WSS) ar...
Jingtao Yao, Joseph P. Herbert
STACS
2001
Springer
15 years 2 months ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
RTA
2010
Springer
15 years 1 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
PDPTA
2000
14 years 11 months ago
Parallel Real-Time Cryptography: Beyond Speedup II
The primary purpose of parallel computation is the fast execution of computational tasks that are too slow to perform sequentially. However, it was shown recently that a second eq...
Selim G. Akl, Stefan D. Bruda