Sciweavers

522 search results - page 15 / 105
» The 3-Steiner Root Problem
Sort
View
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
13 years 8 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
CAISE
2004
Springer
14 years 11 days ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
EUROSYS
2006
ACM
14 years 5 months ago
Automated known problem diagnosis with event traces
Computer problem diagnosis remains a serious challenge to users and support professionals. Traditional troubleshooting methods relying heavily on human intervention make the proce...
Chun Yuan, Ni Lao, Ji-Rong Wen, Jiwei Li, Zheng Zh...
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 2 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel