Sciweavers

24 search results - page 1 / 5
» Optimal Website Design with the Constrained Subtree Selectio...
Sort
View
AI
2006
Springer
13 years 5 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
CEC
2010
IEEE
13 years 6 months ago
Classifier-assisted constrained evolutionary optimization for automated geometry selection of orthodontic retraction spring
In orthodontics, retraction springs made of metallic wires are often used to move a tooth with respect to another by the virtue of the spring back effect. Specially selected form o...
Dudy Lim, Yew-Soon Ong, Rachman Setiawan, Muhammad...
WWW
2009
ACM
14 years 5 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
MP
2006
123views more  MP 2006»
13 years 4 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...