729 search results - page 32 / 146 » Solving subgraph isomorphism problems with constraint progra... |
102
Voted
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
CP
2003
Springer
15 years 2 months ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
81
Voted
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
98
Voted
COMPULOG
1999
Springer
15 years 1 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...