3575 search results - page 313 / 715 » Structured motifs search |
192
click to vote
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
202
click to vote
TPHOL
2000
IEEE
15 years 11 months ago
2000
IEEE
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
171
click to vote
ERCIMDL
2006
Springer
15 years 10 months ago
2006
Springer
Peer-to-peer networks have been identified as promising architectural concept for developing search scenarios across digital library collections. Digital libraries typically offer ...
192
click to vote
AAAI
1996
15 years 8 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
175
click to vote
IJAIT
2007
15 years 6 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...