Sciweavers

510 search results - page 26 / 102
» How Should We Solve Search Problems Privately
Sort
View
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
SARA
2009
Springer
14 years 2 months ago
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
Miroslav N. Velev, Ping Gao 0002
ECAI
2006
Springer
13 years 9 months ago
Calibrating Probability Density Forecasts with Multi-Objective Search
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
Michael Carney, Padraig Cunningham
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
14 years 2 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 7 months ago
SOR: A Practical System for Ontology Storage, Reasoning and Search
Ontology, an explicit specification of shared conceptualization, has been increasingly used to define formal data semantics and improve data reusability and interoperability in en...
Chen Wang, Jean-Sébastien Brunner, Jing Lu,...