4488 search results - page 401 / 898 » Focusing Search by Using Problem Solving Experience |
145
click to vote
ACMMSP
2004
ACM
15 years 11 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
169
Voted
BIBE
2001
IEEE
15 years 9 months ago
2001
IEEE
As various genome sequencing projects have already been completed or are near completion, genome researchers are shifting their focus from structural genomics to functional genomi...
172
click to vote
CDES
2008
15 years 7 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
155
click to vote
IJCAI
2007
15 years 7 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
167
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...