Sciweavers

114 search results - page 19 / 23
» Resource Constrained Shortest Paths
Sort
View
HICSS
2003
IEEE
201views Biometrics» more  HICSS 2003»
14 years 3 months ago
Design and Evaluation of Improvement method on the Web Information Navigation - A Stochastic Search Approach
With the advent of fast growing Internet and World Wide Web (WWW), more and more companies start the electronic commerce to enhance the business competitiveness. On the other hand...
Benjamin P.-C. Yen, Y.-W. Wan
MICRO
1995
IEEE
125views Hardware» more  MICRO 1995»
14 years 1 months ago
Disjoint eager execution: an optimal form of speculative execution
Instruction Level Parallelism (ILP) speedups of an order-of-magnitude or greater may be possible using the techniques described herein. Traditional speculative code execution is t...
Augustus K. Uht, Vijay Sindagi, Kelley Hall
INFOCOM
2007
IEEE
14 years 4 months ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra
INFOCOM
2009
IEEE
14 years 4 months ago
Noncooperative Load Balancing in the Continuum Limit of a Dense Network
Abstract—In transportation network research, the main approach for predicting traffic distribution due to noncooperative vehicle choices has been through fluid type models. The...
Eitan Altman, Ishai Menache, Asuman E. Ozdaglar
COMCOM
2006
80views more  COMCOM 2006»
13 years 9 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...