Sciweavers

3657 search results - page 206 / 732
» A Study of Practical Deduplication
Sort
View
91
Voted
CSDA
2007
98views more  CSDA 2007»
15 years 24 days ago
A new Bayes estimate of the change point in the hazard function
An efficient estimate for the change point in the hazard function is obtained. This is based on a Bayesian estimator which uses equations concerning the parameters of a recently ...
Durdu Sertkaya Karasoy, Cem Kadilar
JPDC
2006
134views more  JPDC 2006»
15 years 23 days ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
93
Voted
KI
2006
Springer
15 years 23 days ago
Gray Box Robustness Testing of Rule Systems
Due to their simple and intuitive manner rules are often used for the implementation of intelligent systems. Besides general methods for the verification and validation of rule sys...
Joachim Baumeister, Jürgen Bregenzer, Frank P...
82
Voted
SOCO
2008
Springer
15 years 22 days ago
Superimposition: A Language-Independent Approach to Software Composition
Superimposition is a composition technique that has been applied successfully in several areas of software development. In order to unify several languages and tools that rely on s...
Sven Apel, Christian Lengauer
APIN
2005
98views more  APIN 2005»
15 years 22 days ago
3-D Container Packing Heuristics
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a f...
Andrew Lim, Brian Rodrigues, Y. Yang