Sciweavers

6251 search results - page 96 / 1251
» Randomness, Computability, and Density
Sort
View
CAMP
2005
IEEE
14 years 3 months ago
Bio-Inspired Computing Architectures: The Embryonics Approach
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
Gianluca Tempesti, Daniel Mange, André Stau...
IEEESCC
2006
IEEE
14 years 4 months ago
Memory Servers: A Scope of SOA for High-End Computing
The expanding gap between microprocessor and disk performance has initiated new techniques of providing memory as a service in high-end computing (HEC). Although the processor and...
Surendra Byna, Xian-He Sun, Ryan Nakhoul
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
JUCS
2007
118views more  JUCS 2007»
13 years 10 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
ICFCA
2009
Springer
14 years 2 months ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...