Sciweavers

4117 search results - page 644 / 824
» On the Satisfiability of Complex Constraints
Sort
View
SIGUCCS
2003
ACM
15 years 12 months ago
Enforcing model network citizenship by remote administration
Higher education institutions have been striving to improve services and keep pace with new technologies. In a Higher education environment, the users utilize the available comput...
Prasun Gupta, Mahmoud Pegah
GECCO
2009
Springer
128views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolving stochastic processes using feature tests and genetic programming
The synthesis of stochastic processes using genetic programming is investigated. Stochastic process behaviours take the form of time series data, in which quantities of interest v...
Brian J. Ross, Janine H. Imada
GECCO
2009
Springer
159views Optimization» more  GECCO 2009»
15 years 11 months ago
Bayesian network structure learning using cooperative coevolution
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
Olivier Barrière, Evelyne Lutton, Pierre-He...
164
Voted
VLDB
2001
ACM
108views Database» more  VLDB 2001»
15 years 11 months ago
Potter's Wheel: An Interactive Data Cleaning System
Cleaning data of errors in structure and content is important for data warehousing and integration. Current solutions for data cleaning involve many iterations of data “auditing...
Vijayshankar Raman, Joseph M. Hellerstein
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...