Sciweavers

603 search results - page 65 / 121
» DFS-Tree Based Heuristic Search
Sort
View
CAV
2000
Springer
89views Hardware» more  CAV 2000»
14 years 11 days ago
Tuning SAT Checkers for Bounded Model Checking
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
Ofer Strichman
AIPS
2006
13 years 9 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
ACSC
2004
IEEE
13 years 11 months ago
Access-Ordered Indexes
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all ...
Steven Garcia, Hugh E. Williams, Adam Cannane
EVOW
2008
Springer
13 years 9 months ago
Improving Metaheuristic Performance by Evolving a Variable Fitness Function
In this paper we study a complex real world workforce scheduling problem. We apply constructive search and variable neighbourhood search (VNS) metaheuristics and enhance these meth...
Keshav P. Dahal, Stephen Remde, Peter I. Cowling, ...
IADIS
2008
13 years 9 months ago
Aggregation in Confidence-Based Concept Discovery for Multi-Relational Data Mining
Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational dat...
Yusuf Kavurucu, Pinar Senkul, Ismail Hakki Toroslu