Sciweavers

5144 search results - page 37 / 1029
» Enhancing Search with Structure
Sort
View
130
Voted
AAAI
1996
15 years 3 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
ICPR
2004
IEEE
16 years 3 months ago
Enhancements for Local Feature Based Image Classification
Using local features with nearest neighbor search and direct voting obtains excellent results for various image classification tasks. In this work we decompose the method into its...
Daniel Keysers, Hermann Ney, Roberto Paredes, Tobi...
DATE
2002
IEEE
91views Hardware» more  DATE 2002»
15 years 7 months ago
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packin...
Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, ...
CEC
2008
IEEE
15 years 8 months ago
Grammatical bias and building blocks in meta-grammar Grammatical Evolution
—This paper describes and tests the utility of a meta Grammar approach to Grammatical Evolution (GE). Rather than employing a fixed grammar as is the case with canonical GE, und...
Erik Hemberg, Michael O'Neill, Anthony Brabazon
PPOPP
2010
ACM
15 years 11 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...