Sciweavers

583 search results - page 73 / 117
» Efficient algorithms for constructing decision trees with co...
Sort
View
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
15 years 10 months ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
IJCAI
2003
14 years 11 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
AIPS
2010
14 years 10 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
CISSE
2008
Springer
14 years 11 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
ICC
2008
IEEE
168views Communications» more  ICC 2008»
15 years 4 months ago
A Balanced Tree-Based Strategy for Unstructured Media Distribution in P2P Networks
—Most research on P2P multimedia streaming assumes that users access video content sequentially and passively. Unlike P2P live streaming in which the peers start playback from th...
Changqiao Xu, Gabriel-Miro Muntean, Enda Fallon, A...