Sciweavers

9842 search results - page 1362 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CIKM
2009
Springer
16 years 1 months ago
Potential collaboration discovery using document clustering and community structure detection
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
Cristian Klen dos Santos, Alexandre Evsukoff, Beat...
COMPLEX
2009
Springer
16 years 1 months ago
Designing Capital-Intensive Systems with Architectural and Operational Flexibility Using a Screening Model
: Development of capital intensive systems, such as offshore oil platforms or other industrial infrastructure, generally requires a significant amount of capital investment under v...
Jijun Lin, Olivier de Weck, Richard de Neufville, ...
CODES
2007
IEEE
16 years 1 months ago
Performance modeling for early analysis of multi-core systems
Performance analysis of microprocessors is a critical step in defining the microarchitecture, prior to register-transfer-level (RTL) design. In complex chip multiprocessor systems...
Reinaldo A. Bergamaschi, Indira Nair, Gero Dittman...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
DIGRA
2005
Springer
16 years 23 days ago
The Nip and the Bite
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
Darshana Jayemanne
« Prev « First page 1362 / 1969 Last » Next »