Sciweavers

3575 search results - page 210 / 715
» Structured motifs search
Sort
View
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
16 years 25 days ago
Pareto optimal search based refactoring at the design level
Refactoring aims to improve the quality of a software systems’ structure, which tends to degrade as the system evolves. While manually determining useful refactorings can be cha...
Mark Harman, Laurence Tratt
AISC
2004
Springer
16 years 2 days ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
MICAI
2004
Springer
16 years 18 hour ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
VISUAL
1999
Springer
15 years 11 months ago
Similarity Search Using Multiple Examples in MARS
Abstract. Unlike traditional database management systems, in multimedia databases that support content-based retrieval over multimedia objects, it is difficult for users to express...
Kriengkrai Porkaew, Sharad Mehrotra, Michael Orteg...
ECIR
2004
Springer
15 years 8 months ago
Applying the Divergence from Randomness Approach for Content-Only Search in XML Documents
Content-only retrieval of XML documents deals with the problem of locating the smallest XML elements that satisfy the query. In this paper, we investigate the application of a spec...
Mohammad Abolhassani, Norbert Fuhr