Sciweavers

EMO
2003
Springer
81views Optimization» more  EMO 2003»
13 years 9 months ago
Solving Hierarchical Optimization Problems Using MOEAs
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
Christian Haubelt, Sanaz Mostaghim, Jürgen Te...
ICDM
2003
IEEE
136views Data Mining» more  ICDM 2003»
13 years 9 months ago
Statistical Relational Learning for Document Mining
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have compl...
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence...
ICDAR
2003
IEEE
13 years 9 months ago
Accelerating Large Character Set Recognition using Pivots
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
Yiping Yang, Ondrej Velek, Masaki Nakagawa
VMCAI
2004
Springer
13 years 9 months ago
History-Dependent Scheduling for Cryptographic Processes
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...
Vincent Vanackère
SOFSEM
2004
Springer
13 years 9 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
SETN
2004
Springer
13 years 9 months ago
Inherent Choice in the Search Space of Constraint Satisfaction Problem Instances
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
PADL
2004
Springer
13 years 9 months ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ICIAR
2004
Springer
13 years 9 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
13 years 9 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
ISCIS
2005
Springer
13 years 9 months ago
An Investigation of the Course-Section Assignment Problem
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
Zeki Bayram