Sciweavers

5263 search results - page 145 / 1053
» Open Constraint Optimization
Sort
View
139
Voted
CINQ
2004
Springer
119views Database» more  CINQ 2004»
15 years 9 months ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
142
Voted
CP
1997
Springer
15 years 7 months ago
Distributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
Katsutoshi Hirayama, Makoto Yokoo
127
Voted
CONSTRAINTS
2002
111views more  CONSTRAINTS 2002»
15 years 3 months ago
A Constraint-Based Interactive Train Rescheduling Tool
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
C. K. Chiu, C. M. Chou, Jimmy Ho-Man Lee, Ho-fung ...
122
Voted
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
15 years 10 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
121
Voted
ICDT
2005
ACM
130views Database» more  ICDT 2005»
15 years 9 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash