Sciweavers

15777 search results - page 2399 / 3156
» Software Engineering
Sort
View
FOSSACS
2003
Springer
16 years 19 days ago
Model Checking Lossy Channels Systems Is Probably Decidable
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these syste...
Nathalie Bertrand, Ph. Schnoebelen
FSTTCS
2003
Springer
16 years 19 days ago
Pushdown Games with Unboundedness and Regular Conditions
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...
FSTTCS
2003
Springer
16 years 19 days ago
Word Equations over Graph Products
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
Volker Diekert, Markus Lohrey
FSTTCS
2003
Springer
16 years 19 days ago
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
Nikhil R. Devanur, Vijay V. Vazirani
ICCBSS
2003
Springer
16 years 19 days ago
Assessment of Reusable COTS Attributes
Among the main activities involved in COTS-based development there are identification, evaluation, and selection of COTS products. Several techniques have been developed for these ...
Marco Torchiano, Maria Letizia Jaccheri
« Prev « First page 2399 / 3156 Last » Next »