Sciweavers

70 search results - page 3 / 14
» Non-classical preference models in combinatorial problems: M...
Sort
View
CIMCA
2005
IEEE
13 years 12 months ago
A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
Maolin Tang, Raymond Y. K. Lau
ECRA
2010
145views more  ECRA 2010»
13 years 6 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
SPAA
2004
ACM
13 years 11 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
CSJM
2006
76views more  CSJM 2006»
13 years 6 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
13 years 3 months ago
Multiobjective evolutionary algorithm for software project portfolio optimization
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
Thomas Kremmel, Jirí Kubalík, Stefan...