1047 search results - page 31 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
DKE
2002
13 years 7 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
JSCIC
2008
2008
Mathematical and Numerical Aspects of a Phase-field Approach to Critical Nuclei Morphology in Solids
13 years 7 months ago
Abstract We investigate a phase-field model for homogeneous nucleation and critical nucleus morphology in solids. We analyze the mathematical properties of a free energy functional...
CP
2009
Springer
14 years 8 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
ACSD
2004
IEEE
13 years 11 months ago
2004
IEEE
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...