Sciweavers

519 search results - page 21 / 104
» A New Approach to Strongly Polynomial Linear Programming
Sort
View
LOPSTR
2007
Springer
15 years 7 months ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
COCO
2009
Springer
78views Algorithms» more  COCO 2009»
15 years 8 months ago
Fixed-Polynomial Size Circuit Bounds
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
Lance Fortnow, Rahul Santhanam, Ryan Williams
BMCBI
2010
97views more  BMCBI 2010»
15 years 1 months ago
Kinome-wide interaction modelling using alignment-based and alignment-independent approaches for kinase description and linear a
Background: Protein kinases play crucial roles in cell growth, differentiation, and apoptosis. Abnormal function of protein kinases can lead to many serious diseases, such as canc...
Maris Lapinsh, Jarl E. S. Wikberg
NETCOOP
2007
Springer
15 years 7 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski
IPPS
2007
IEEE
15 years 7 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert