Sciweavers

677 search results - page 34 / 136
» A New Start-Up Demonstration Test
Sort
View
FCT
2005
Springer
15 years 5 months ago
Almost Optimal Explicit Selectors
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
Bogdan S. Chlebus, Dariusz R. Kowalski
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Cause Clue Clauses: Error Localization using Maximum Satisfiability
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
Manu Jose, Rupak Majumdar
INTERACTION
2009
ACM
15 years 6 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
MSS
2007
IEEE
79views Hardware» more  MSS 2007»
15 years 6 months ago
Inter-node Communication in Peer-to-Peer Storage Clusters
Storage clusters try to transfer the idea of cluster com­ puting into the storage domain and to scale capacity and performance by simply adding new cluster components. This paper...
André Brinkmann, Sascha Effert
CEC
2003
IEEE
15 years 5 months ago
Homology gives size control in genetic programming
Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully test...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...