Sciweavers

1552 search results - page 88 / 311
» On the Complexity of Constant Propagation
Sort
View
KES
2004
Springer
15 years 11 months ago
Towards Cortex Sized Artificial Nervous Systems
We characterize the size and complexity of the mammalian cortices of human, macaque, cat, rat, and mouse. We map the cortical structure onto a Bayesian confidence propagating neura...
Christopher Johansson, Anders Lansner
CSCLP
2008
Springer
15 years 8 months ago
Combining Symmetry Breaking and Global Constraints
Abstract. We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a g...
George Katsirelos, Nina Narodytska, Toby Walsh
IV
2005
IEEE
131views Visualization» more  IV 2005»
15 years 12 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
PPL
2010
118views more  PPL 2010»
15 years 4 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
STACS
2005
Springer
15 years 12 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning