2911 search results - page 218 / 583 » A Logic of Graph Constraints |
163
click to vote
DISOPT
2008
15 years 6 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
203
click to vote
DLOG
1998
15 years 8 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
204
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
283
click to vote
GECCO
2003
Springer
16 years 18 min ago
2003
Springer
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
166
click to vote
FOIKS
2010
Springer
15 years 10 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...