Sciweavers

1971 search results - page 359 / 395
» Tabu search - Uncharted domains
Sort
View
113
Voted
CP
2005
Springer
15 years 6 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
105
Voted
ICALP
2005
Springer
15 years 6 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
119
Voted
SG
2005
Springer
15 years 6 months ago
Multi-level Interaction in Parametric Design
Parametric design systems model a design as a constrained collection of schemata. Designers work in such systems at two levels: definition of schemata and constraints; and search w...
Robert Aish, Robert Woodbury
SAC
2004
ACM
15 years 6 months ago
Integrating similarity-based queries in image DBMSs
Until recently, issues in image retrieval have been handled in DBMSs and in computer vision as separate research works. Nowadays, the trend is towards integrating the two approach...
Solomon Atnafu, Richard Chbeir, David Coquil, Lion...
ECWEB
2004
Springer
179views ECommerce» more  ECWEB 2004»
15 years 6 months ago
Applying Text Mining on Electronic Messages for Competitive Intelligence
This paper presents how text -mining techniques can be used to analyze an enterprise’s external environment searching for competitors, related products and services, marketing st...
José Palazzo Moreira de Oliveira, Stanley L...