Sciweavers

895 search results - page 60 / 179
» Using graphs for some discrete tomography problems
Sort
View
MOC
2000
126views more  MOC 2000»
13 years 10 months ago
Adaptive multilevel methods in space and time for parabolic problems-the periodic case
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
J. B. Burie, M. Marion
EOR
2010
99views more  EOR 2010»
13 years 11 months ago
Mathematical programming models for revenue management under customer choice
We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which custome...
Lijian Chen, Tito Homem-de-Mello
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
PVLDB
2010
152views more  PVLDB 2010»
13 years 9 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 3 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran