882 search results - page 123 / 177 » Local Search for Very Large SAT Problems |
143
Voted
ICDAR
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
154
click to vote
AAAI
2000
15 years 5 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
122
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Large systems of agents deployed in a real-world environment face threats to their problem solving performance that are independent of the complexity of the problem or the charact...
218
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
116
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...