Sciweavers

729 search results - page 34 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
SIBGRAPI
2008
IEEE
15 years 10 months ago
Structural Matching of 2D Electrophoresis Gels using Graph Models
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
121
Voted
ICMLA
2009
15 years 1 months ago
Learning Probabilistic Structure Graphs for Classification and Detection of Object Structures
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
Johannes Hartz
133
Voted
IFIP
1998
Springer
15 years 7 months ago
Scheduling in a Multi-Agent Environment
A new scheduling agent for existing CIM multi-agent system is being currently developed at the Technical University of Kosice. The basic idea is to create an agent based on Schedu...
M. Schmotzer, Jan Paralic, Julius Csontó
141
Voted
CPAIOR
2010
Springer
15 years 2 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...
112
Voted
COR
2006
98views more  COR 2006»
15 years 3 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve