Sciweavers

882 search results - page 114 / 177
» Local Search for Very Large SAT Problems
Sort
View
WWW
2009
ACM
16 years 4 months ago
Understanding user's query intent with wikipedia
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...
Jian Hu, Gang Wang, Frederick H. Lochovsky, Jian-T...
AMAI
2004
Springer
15 years 9 months ago
Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums
Abstract. We introduce a new global constraint which combines together the lexicographic ordering constraint with two sum constraints. Lexicographic ordering constraints are freque...
Brahim Hnich, Zeynep Kiziltan, Toby Walsh
KES
1999
Springer
15 years 8 months ago
Dynamic Demes parallel genetic algorithm
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
Mariusz Nowostawski, Riccardo Poli
HPDC
2005
IEEE
15 years 9 months ago
Genetic algorithm based automatic data partitioning scheme for HPF
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...
Sunil Kumar Anand, Y. N. Srikant
WEBDB
2009
Springer
172views Database» more  WEBDB 2009»
15 years 10 months ago
PrivatePond: Outsourced Management of Web Corpuses
With the rise of cloud computing, it is increasingly attractive for end-users (organizations and individuals) to outsource the management of their data to a small number of larges...
Daniel Fabbri, Arnab Nandi, Kristen LeFevre, H. V....