6036 search results - page 1115 / 1208 » Web search solved |
134
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
137
click to vote
RTA
1995
Springer
15 years 8 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
168
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
182
click to vote
HYBRID
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
150
click to vote
AAAI
2004
15 years 5 months ago
2004
Learning reusable sequences can support the development of expertise in many domains, either by improving decisionmaking quality or decreasing execution speed. This paper introduc...