Sciweavers

19130 search results - page 144 / 3826
» Modelling multi-path problems
Sort
View
4OR
2005
104views more  4OR 2005»
15 years 6 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
JOIN
2007
133views more  JOIN 2007»
15 years 6 months ago
The Coverage Problem in Three-Dimensional Wireless Sensor Networks
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
Chi-Fu Huang, Yu-Chee Tseng, Li-Chu Lo
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
15 years 6 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 3 months ago
Equilibrium Pricing of Digital Goods via a New Market Model
The problem of arriving at a principled method of pricing goods and services was very satisfactorily solved for conventional goods; however, this solution is not applicable to dig...
Kamal Jain, Vijay V. Vazirani
ICASSP
2010
IEEE
15 years 6 months ago
Synthesis of filled pauses based on a disfluent speech model
In the present paper we present a new approach to the synthesis of filled pauses. The problem is tackled from the point of view of disfluent speech synthesis. Based on the synth...
Jordi Adell, Antonio Bonafonte, David Escudero Man...