Sciweavers

1101 search results - page 73 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
AOR
2010
14 years 7 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 4 months ago
Scalable Fault Diagnosis in IP Networks using Graphical Models: A Variational Inference Approach
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...
Rajesh Narasimha, Souvik Dihidar, Chuanyi Ji, Stev...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 3 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
SIGGRAPH
1993
ACM
15 years 1 months ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm