Sciweavers

11151 search results - page 197 / 2231
» On the Complexity of Model Expansion
Sort
View
ADG
2000
Springer
110views Mathematics» more  ADG 2000»
15 years 11 months ago
Decision Complexity in Dynamic Geometry
Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding w...
Ulrich Kortenkamp, Jürgen Richter-Gebert
NETWORKING
2008
15 years 8 months ago
On the Robustness of Complex Networks by Using the Algebraic Connectivity
The second smallest eigenvalue of the Laplacian matrix, also known as the algebraic connectivity, plays a special role for the robustness of complex networks since it measures the ...
A. Jamakovic, Piet Van Mieghem
187
Voted
AMC
2007
114views more  AMC 2007»
15 years 7 months ago
Software complexity: A statistical case study through insertion sort
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
Anchala Kumari, Soubhik Chakraborty
JASSS
2002
85views more  JASSS 2002»
15 years 6 months ago
"Methodological Implications of Complex Systems Approaches to Sociality": Some Further Remarks
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...
Kurt A. Richardson
233
Voted
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 1 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman