Sciweavers

4131 search results - page 455 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
EMMCVPR
1997
Springer
15 years 11 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
PLDI
2000
ACM
15 years 10 months ago
Off-line variable substitution for scaling points-to analysis
Most compiler optimizations and software productivity tools rely on information about the effects of pointer dereferences in a program. The purpose of points-to analysis is to com...
Atanas Rountev, Satish Chandra
GECCO
2010
Springer
141views Optimization» more  GECCO 2010»
15 years 10 months ago
Today/future importance analysis
SBSE techniques have been widely applied to requirements selection and prioritization problems in order to ascertain a suitable set of requirements for the next release of a syste...
Yuanyuan Zhang, Enrique Alba, Juan J. Durillo, Sig...
FLAIRS
2008
15 years 9 months ago
Recovering from Inconsistency in Distributed Simple Temporal Networks
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
Anthony Gallagher, Stephen F. Smith