Sciweavers

1142 search results - page 94 / 229
» Approximability of Clausal Constraints
Sort
View
INFOCOM
2000
IEEE
15 years 10 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 6 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
CP
2010
Springer
15 years 5 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
FOCS
2006
IEEE
16 years 14 days ago
How to Play Unique Games Using Embeddings
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc...
JFPLC
2003
15 years 7 months ago
Une approche hybride pour l'optimisation multi-objectif sous contraintes
ABSTRACT. We present PICPA, a new algorithm for tackling constrained continuous multiobjective problems. The algorithm combines constraint propagation techniques and evolutionary c...
Vincent Barichard, Jin-Kao Hao