15033 search results - page 196 / 3007 » Complexity Theory and Algorithms |
111
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
120
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
There is a growing need for a theory of “local to global” in distributed multi-agent systems, one which is able systematically to describe and analyze a variety of problems. T...
118
click to vote
ICIP
2000
IEEE
16 years 6 months ago
2000
IEEE
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
124
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
111
click to vote
RE
2006
Springer
15 years 4 months ago
2006
Springer
Cross-organizational information systems projects, such as ERP, imply an expensive requirements engineering (RE) cycle. Little is known yet about how to carry it out with more pre...