4488 search results - page 259 / 898 » Focusing Search by Using Problem Solving Experience |
122
click to vote
GCB
1997
Springer
15 years 8 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
134
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
123
click to vote
HT
1993
ACM
15 years 8 months ago
1993
ACM
Hypertexts may be implicitly structured, based on either node content or context. In this paper, we examine implicit structures that rely on the interpretation of node’s spatial...
118
click to vote
GLVLSI
2005
IEEE
15 years 10 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
201
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...