Sciweavers

174 search results - page 18 / 35
» Interval-valued soft constraint problems
Sort
View
143
Voted
ATAL
2009
Springer
15 years 10 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
144
Voted
AISB
1995
Springer
15 years 7 months ago
The Ant Colony Metaphor for Searching Continuous Design Spaces
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
George Bilchev, Ian C. Parmee
153
Voted
AI
2010
Springer
15 years 3 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
159
Voted
BALT
2006
15 years 7 months ago
Introducing Softness into Inductive Queries on String Databases
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
Ieva Mitasiunaite, Jean-François Boulicaut
140
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 10 months ago
CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads
Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instan...
Debabrata Dash, Neoklis Polyzotis, Anastasia Ailam...