Sciweavers

14190 search results - page 275 / 2838
» computer 2008
Sort
View
TRANSCI
2008
80views more  TRANSCI 2008»
15 years 6 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...
CN
2000
92views more  CN 2000»
15 years 6 months ago
What is this page known for? Computing Web page reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Davood Rafiei, Alberto O. Mendelzon
DEBU
2000
96views more  DEBU 2000»
15 years 6 months ago
What do the Neighbours Think? Computing Web Page Reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Alberto O. Mendelzon, Davood Rafiei
SIAMJO
2000
116views more  SIAMJO 2000»
15 years 6 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
DAM
2002
82views more  DAM 2002»
15 years 6 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian