Sciweavers

1920 search results - page 328 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
CP
2007
Springer
15 years 4 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
ECUMN
2007
Springer
15 years 4 months ago
End-to-End Distance Computation in Grid Environment by NDS, the Network Distance Service
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
Julien Gossa, Jean-Marc Pierson
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 4 months ago
Search-based testing of service level agreements
The diffusion of service oriented architectures introduces the need for novel testing approaches. On the one side, testing must be able to identify failures in the functionality ...
Massimiliano Di Penta, Gerardo Canfora, Gianpiero ...
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
15 years 3 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
IPPS
2006
IEEE
15 years 3 months ago
Ad-hoc distributed spatial joins on mobile devices
PDAs, cellular phones and other mobile devices are now capable of supporting complex data manipulation operations. Here, we focus on ad-hoc spatial joins of datasets residing in m...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras, Xi...