Sciweavers

1983 search results - page 142 / 397
» Competitive graph searches
Sort
View
HEURISTICS
2010
13 years 2 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
CP
2006
Springer
13 years 11 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
ISPDC
2008
IEEE
14 years 2 months ago
FPGA Implementations of a Parallel Associative Processor with Multi-Comparand Multi-Search Operations
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
Zbigniew Kokosinski, Bartlomiej Malus
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
14 years 1 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
ICWE
2010
Springer
13 years 6 months ago
Semantic Wonder Cloud: Exploratory Search in DBpedia
Inspired by the Google Wonder Wheel1 , in this paper we present Semantic Wonder Cloud (SWOC): a tool that helps users in knowledge exploration within the DBpedia dataset by adoptin...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...