1550 search results - page 145 / 310 » Benchmarking for Graph Transformation |
211
Voted
CP
2009
Springer
16 years 4 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
176
click to vote
HICSS
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper discusses the design and implementation of a Service Generator Toolkit (SGT) that allows web services researchers to easily create large numbers of web services. When d...
150
Voted
NCA
2007
IEEE
15 years 9 months ago
2007
IEEE
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
147
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
127
click to vote
EOR
2007
15 years 3 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...