Sciweavers

5316 search results - page 869 / 1064
» Which Search Problems Are Random
Sort
View
166
Voted
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 10 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
MM
2005
ACM
122views Multimedia» more  MM 2005»
15 years 10 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
EVOW
1994
Springer
15 years 8 months ago
Competitive Evolution: A Natural Approach to Operator Selection
One of the main problems in applying evolutionary optimisation methods is the choice of operators and parameter values. This paper propose a competitive evolution method, in which ...
Q. Tuan Pham
RTSS
1992
IEEE
15 years 8 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
150
Voted
CP
2004
Springer
15 years 8 months ago
ID Walk: A Candidate List Strategy with a Simple Diversification Device
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
Bertrand Neveu, Gilles Trombettoni, Fred Glover