Sciweavers

2905 search results - page 366 / 581
» Formal Memetic Algorithms
Sort
View
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 4 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
133
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 ...
DKE
2002
218views more  DKE 2002»
15 years 3 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
IGPL
1998
97views more  IGPL 1998»
15 years 3 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
MICS
2008
87views more  MICS 2008»
15 years 3 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli