280 results on '"Christine Solnon"'
Search Results
2. Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming.
3. Automatic boomerang attacks search on Rijndael.
4. Exact and anytime approach for solving the time dependent traveling salesman problem with time windows.
5. Non-Crossing Anonymous MAPF for Tethered Robots.
6. And Rijndael?: Automatic Related-Key Differential Analysis of Rijndael.
7. An asymptotic approximation of the traveling salesman problem with uniform non-overlapping time windows.
8. Solving the Non-Crossing MAPF with CP.
9. Automatic Generation of Declarative Models For Differential Cryptanalysis.
10. ACO with automatic parameter selection for a scheduling problem with a group cumulative constraint.
11. Solving the Group Cumulative Scheduling Problem with CPO and ACO.
12. abstractXOR: A global constraint dedicated to differential cryptanalysis.
13. A CP-based Automatic Tool for Instantiating Truncated Differential Characteristics - Extended Version.
14. Experimental Evaluation of Subgraph Isomorphism Solvers.
15. A Global Constraint for the Exact Cover Problem: Application to Conceptual Clustering.
16. Comparison of Traffic Forecasting Methods in Urban and Suburban Context.
17. Observations from Parallelising Three Maximum Common (Connected) Subgraph Algorithms.
18. Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis.
19. Using Constraint Programming to solve a Cryptanalytic Problem.
20. Combining CP and ILP in a Tree Decomposition of Bounded Height for the Sum Colouring Problem.
21. The Static and Stochastic VRP with Time Windows and both Random Customers and Reveal Times.
22. Constraint Programming for Multi-criteria Conceptual Clustering.
23. When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases.
24. Revisiting AES related-key differential attacks with constraint programming.
25. Computing AES related-key differential characteristics with constraint programming.
26. Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports.
27. Portfolios of Subgraph Isomorphism Algorithms.
28. GriMa: A Grid Mining Algorithm for Bag-of-Grid-Based Classification.
29. Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems.
30. Constraint Programming Models for Chosen Key Differential Cryptanalysis.
31. A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem.
32. A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems.
33. A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW.
34. Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times.
35. Using Canonical Codes to Efficiently Solve the Benzenoid Generation Problem with Constraint Programming
36. 2D Topological Map Isomorphism for Multi-Label Simple Transformation Definition.
37. Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector.
38. On the Complexity of Submap Isomorphism.
39. Map Edit Distance vs. Graph Edit Distance for Matching Images.
40. Castor: A Constraint-Based SPARQL Engine with Active Filter Processing.
41. Measuring the Distance of Generalized Maps.
42. Frequent Submap Discovery.
43. CP Models for Maximum Common Subgraph Problems.
44. An Efficient Light Solver for Querying the Semantic Web.
45. Strong Combination of Ant Colony Optimization with Constraint Programming Optimization.
46. On the complexity of submap isomorphism and maximum common submap problems.
47. A Polynomial Algorithm for Submap Isomorphism.
48. Classification of Images Based on Hidden Markov Models.
49. Signatures of Combinatorial Maps.
50. An ACO-Based Reactive Framework for Ant Colony Optimization: First Experiments on Constraint Satisfaction Problems.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.