Sciweavers

3678 search results - page 488 / 736
» On the Stable Paths Problem
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 9 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
CAAN
2006
Springer
15 years 9 months ago
Distributed Routing in Tree Networks with Few Landmarks
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
Ioannis Z. Emiris, Euripides Markou, Aris Pagourtz...
CAISE
2006
Springer
15 years 9 months ago
An Efficient Approach to Support Querying Secure Outsourced XML Information
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
Yin Yang, Wilfred Ng, Ho Lam Lau, James Cheng
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 9 months ago
A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies
First, the covariance matrix adaptation (CMA) with rankone update is introduced into the (1+1)-evolution strategy. An improved implementation of the 1/5-th success rule is propose...
Christian Igel, Thorsten Suttorp, Nikolaus Hansen
DAC
1995
ACM
15 years 9 months ago
The Validity of Retiming Sequential Circuits
Retiming has been proposed as an optimizationstep forsequential circuits represented at the net-list level. Retiming moves the latches across the logic gates and in doing so chang...
Vigyan Singhal, Carl Pixley, Richard L. Rudell, Ro...