566 search results - page 77 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
94
Voted
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
AAAI
2007
15 years 2 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
123
Voted
EC
2008
15 years 15 days ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
103
Voted
WSC
1997
15 years 1 months ago
1997
Model abstraction using metamodeling has demonstrated the capability to facilitate software reuse, large scale model integration, verification, and validation. Once restricted to...
110
Voted
ISICT
2003
15 years 1 months ago
2003
As computers become ubiquitous in our every day lives, providing a means for true user empowerment will become crucial. Techniques which allow dynamic reuse and composition of exi...