28888 search results - page 417 / 5778 » Computability and complexity in analysis |
204
click to vote
COMPUTING
2010
15 years 4 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
216
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
ionally Sound Abstraction and Verification of Secure Multi-Party Computations Michael Backes Saarland University MPI-SWS Matteo Maffei Saarland University Esfandiar Mohammadi Saarl...
180
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We propose a computational model that facilitates agents in a MAS to collaboratively evolve their norms to reach the best norm conventions. Our approach borrows from the social con...
190
click to vote
DLT
2003
15 years 8 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
171
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...