Sciweavers

1176 search results - page 64 / 236
» Implicit Abstraction Heuristics
Sort
View
CSCLP
2006
Springer
14 years 1 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
CP
1995
Springer
14 years 1 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run
JMLR
2012
12 years 12 days ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
IPPS
2006
IEEE
14 years 4 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
ICCS
2003
Springer
14 years 3 months ago
The PAGIS Grid Application Environment
Abstract. Although current programming models provide adequate performance, many prove inadequate to support the effective development of efficient Grid applications. Many of the ...
Darren Webb, Andrew L. Wendelborn