Sciweavers

805 search results - page 33 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
AI
2010
Springer
13 years 8 months ago
AllDifferent-based filtering for subgraph isomorphism
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
Christine Solnon
ISDA
2010
IEEE
13 years 6 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
SAC
2006
ACM
13 years 8 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
DSS
2007
113views more  DSS 2007»
13 years 8 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 6 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi