Sciweavers

565 search results - page 100 / 113
» Heuristics for Planning with SAT
Sort
View
CP
2007
Springer
14 years 2 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
14 years 2 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
IWCLS
2007
Springer
14 years 2 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
DASFAA
2006
IEEE
168views Database» more  DASFAA 2006»
14 years 2 months ago
PMJoin: Optimizing Distributed Multi-way Stream Joins by Stream Partitioning
Abstract. In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communica...
Yongluan Zhou, Ying Yan, Feng Yu, Aoying Zhou
CCGRID
2005
IEEE
14 years 1 months ago
Servicing range queries on multidimensional datasets with partial replicas
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
Li Weng, Ümit V. Çatalyürek, Tahs...