Sciweavers

11160 search results - page 2039 / 2232
» Incompleteness in a General Setting
Sort
View
OR
2005
Springer
15 years 10 months ago
Optimal Fares for Public Transport
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
Ralf Borndörfer, Marika Neumann, Marc E. Pfet...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 10 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
CCS
2005
ACM
15 years 10 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
ICS
2005
Tsinghua U.
15 years 10 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
ACMICEC
2004
ACM
106views ECommerce» more  ACMICEC 2004»
15 years 10 months ago
Measuring e-government impact: existing practices and shortcomings
Public administrations of all over the world invest an enormous amount of resources in e-government. How the success of egovernment can be measured is often not clear. E-governmen...
Rob M. Peters, Marijn Janssen, Tom M. van Engers
« Prev « First page 2039 / 2232 Last » Next »