Sciweavers

1483 search results - page 22 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
CP
2009
Springer
15 years 8 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann
JCB
2006
144views more  JCB 2006»
15 years 1 months ago
Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition
We develop a model for elucidating the assembly pathways by which an icosahedral viral shell forms from 60 identical constituent protein monomers. This poorly understood process a...
Meera Sitharam, Mavis Agbandje-Mckenna
STACS
2010
Springer
15 years 6 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
CP
2001
Springer
15 years 5 months ago
Collaborative Learning for Constraint Solving
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
Susan L. Epstein, Eugene C. Freuder
NSDI
2007
15 years 3 months ago
Octant: A Comprehensive Framework for the Geolocalization of Internet Hosts
Determining the physical location of Internet hosts is a critical enabler for many new location-aware services. In this paper, we present Octant, a novel, comprehensive framework ...
Bernard Wong, Ivan Stoyanov, Emin Gün Sirer