Sciweavers

13621 search results - page 25 / 2725
» Computability and Complexity in Self-assembly
Sort
View
LATIN
2010
Springer
14 years 1 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
AHS
2007
IEEE
202views Hardware» more  AHS 2007»
13 years 10 months ago
PERPLEXUS: Pervasive Computing Framework for Modeling Complex Virtually-Unbounded Systems
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
Eduardo Sanchez, Andrés Pérez-Uribe,...
LICS
2009
IEEE
14 years 4 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
AI
2006
Springer
13 years 10 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
CVPR
2003
IEEE
14 years 12 months ago
A Hybrid Approach for Computing Visual Hulls of Complex Objects
This paper addresses the problem of computing visual hulls from image contours. We propose a new hybrid approach which overcomes the precision-complexity trade-off inherent to vox...
Edmond Boyer, Jean-Sébastien Franco