Sciweavers

4208 search results - page 330 / 842
» Better Selection of the Best
Sort
View
UML
2005
Springer
16 years 5 days ago
Representing and Applying Design Patterns: What Is the Problem?
Design patterns embody proven solutions to recurring design problems. Ever since the gang of four popularized the concept, researchers have been trying to develop methods for repre...
Hafedh Mili, Ghizlane El-Boussaidi
CVPR
2010
IEEE
16 years 1 days ago
Dense Interest Points
Local features or image patches have become a standard tool in computer vision, with numerous application domains. Roughly speaking, two different types of patchbased image repres...
Tinne Tuytelaars
HT
2003
ACM
15 years 12 months ago
Do adaptation rules improve web cost estimation?
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
Emilia Mendes, Nile Mosley, Steve Counsell
GECCO
2003
Springer
15 years 12 months ago
Optimization Using Particle Swarms with Near Neighbor Interactions
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
Kalyan Veeramachaneni, Thanmaya Peram, Chilukuri K...
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 11 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...