Sciweavers

2862 search results - page 44 / 573
» Bicriteria Network Design Problems
Sort
View
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
14 years 9 days ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 5 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
WINE
2007
Springer
182views Economy» more  WINE 2007»
14 years 5 months ago
Mechanism Design on Trust Networks
We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed ...
Arpita Ghosh, Mohammad Mahdian, Daniel M. Reeves, ...
DEXAW
2008
IEEE
121views Database» more  DEXAW 2008»
14 years 5 months ago
Experiences on Designing an Integral Intrusion Detection System
Network Intrusion Detection Systems (NIDS) have the challenge to prevent network attacks and unauthorised remote use of computers. In order to achieve this goal, NIDS usually foll...
Yoseba K. Penya, Pablo Garcia Bringas
ICAISC
2004
Springer
14 years 4 months ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak