Sciweavers

1795 search results - page 199 / 359
» Search by strategy
Sort
View
PRICAI
1998
Springer
15 years 10 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
EUROPAR
2006
Springer
15 years 10 months ago
Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems
Abstract. In peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal replication is attained...
Elias Leontiadis, Vassilios V. Dimakopoulos, Evagg...
AAAI
1993
15 years 8 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
CGF
2008
227views more  CGF 2008»
15 years 6 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 6 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani