Sciweavers

5329 search results - page 388 / 1066
» The Weighted Majority Algorithm
Sort
View
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
15 years 10 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
DAC
2005
ACM
15 years 8 months ago
Timing-driven placement by grid-warping
Grid-warping is a recent placement strategy based on a novel physical analogy: rather than move the gates to optimize their location, it elastically deforms a model of the 2-D chi...
Zhong Xiu, Rob A. Rutenbar
CATS
1998
15 years 8 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 7 months ago
A tree-based GA representation for the portfolio optimization problem
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
Claus de Castro Aranha, Hitoshi Iba
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 7 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....