Sciweavers

368 search results - page 43 / 74
» System BV is NP-complete
Sort
View
53
Voted
SCL
2008
56views more  SCL 2008»
15 years 11 days ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
TCS
2008
15 years 11 days ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
IS
2007
15 years 11 days ago
Formalizing the evolution of virtual communities
Collaboration increasingly takes place in virtual communities using the Internet. These communities are socio-technical systems that tend to evolve strongly and become more comple...
Aldo de Moor, Hans Weigand
92
Voted
AI
2004
Springer
15 years 10 days ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
89
Voted
AI
2002
Springer
15 years 10 days ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado